Some 0/1 polytopes need exponential size extended formulations
- 8 July 2012
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 142 (1-2) , 255-268
Abstract
No abstract availableKeywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Extended Formulations for PolygonsDiscrete & Computational Geometry, 2012
- Extended formulations in combinatorial optimization4OR, 2010
- Computational Complexity2009
- Approximate formulations for 0-1 knapsack setsOperations Research Letters, 2008
- Disjunctive programming: Properties of the convex hull of feasible pointsDiscrete Applied Mathematics, 1998
- On cuts and matchings in planar graphsMathematical Programming, 1993
- An application of simultaneous diophantine approximation in combinatorial optimizationCombinatorica, 1987
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization ProblemsSIAM Journal on Algebraic Discrete Methods, 1985
- Parity, circuits, and the polynomial-time hierarchyTheory of Computing Systems, 1984
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965