A note on the extension complexity of the knapsack polytope

Operations Research Letters

Volumn 41, Issue 4, 2013, Pages 347-350

  Pokutta, Sebastian ^a   Van Vyve, Mathieu ^b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Approximation algorithms; Extension complexity; Knapsack polytope

Indexed keywords

EXTENSION COMPLEXITY; POLYTOPES;

APPROXIMATION ALGORITHMS;

COMBINATORIAL OPTIMIZATION;

EID: 84877020334     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2013.03.010     Document Type: Article

References (12)

1. David L. Applegate, Robert E. Bixby, Vasek Chvatal, and William J. Cook The Traveling Salesman Problem: A Computational Study Princeton Series in Applied Mathematics 2007 Princeton University Press
2. D. Avis, H.R. Tiwary, On the extension complexity of combinatorial polytopes. ArXiv e-prints, February 2013.
3. Daniel Bienstock Approximate formulations for 0-1 knapsack sets Oper. Res. Lett. 36 3 2008 317 320
4. G. Braun, S. Fiorini, S. Pokutta, D. Steurer, Approximation limits of linear programs (beyond hierarchies), in: Proceedings of FOCS, 2012.
5. G. Braun, S. Pokutta, Common information and unique disjointness, ECCC Working Paper TR13-056.
6. M. Braverman, A. Moitra, An information complexity approach to extended formulations, in: Electronic Colloquium on Computational Complexity, ECCC, vol. 19, 2012, p. 131.
7. S. Fiorini, S. Massar, S. Pokutta, H.R. Tiwary, R. de Wolf, Linear vs. Semidefinite Extended Formulations: Exponential Separation and Strong Lower Bounds, ArXiv e-prints, July 2012.
8. S. Fiorini, S. Massar, S. Pokutta, H.R. Tiwary, R. de Wolf, Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds, in: Proceedings of STOC 2012, 2012, Preprint at arxiv:1111.0837.
9. H. Kellerer, U. Pferschy, and D. Pisinger Knapsack Problems 2004 Springer Berlin, Germany
10. Yves Pochet, and Laurence A. Wolsey Production Planning by Mixed Integer Programming 2006 Springer-Verlag New York
11. Vijay V. Vazirani Approximation Algorithms 2004 Springer
12. David P. Williamson, and David B. Shmoys The Design of Approximation Algorithms 2011 Cambridge University Press