| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142344 | Operations Research Letters | 2013 | 4 Pages |
Abstract
We show that there are 0–1 and unbounded knapsack polytopes with super-polynomial extension complexity. More specifically, for each n∈Nn∈N we exhibit 0–1 and unbounded knapsack polytopes in dimension nn with extension complexity Ω(2n).
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Sebastian Pokutta, Mathieu Van Vyve,