Extended formulations in combinatorial optimization
- 9 January 2013
- journal article
- research article
- Published by Springer Nature in Annals of Operations Research
- Vol. 204 (1) , 97-143
Abstract
No abstract availableKeywords
This publication has 43 references indexed in Scilit:
- Extended Formulations for PolygonsDiscrete & Computational Geometry, 2012
- Tightening simple mixed-integer sets with guaranteed boundsMathematical Programming, 2010
- Extended formulations in combinatorial optimization4OR, 2010
- Packing and partitioning orbitopesMathematical Programming, 2007
- Tight formulations for some simple mixed integer programs and convex objective integer programsMathematical Programming, 2003
- Disjunctive programming: Properties of the convex hull of feasible pointsDiscrete Applied Mathematics, 1998
- Expressing combinatorial optimization problems by Linear ProgramsJournal of Computer and System Sciences, 1991
- Compact systems for T-join and perfect matching polyhedra of graphs with bounded genusOperations Research Letters, 1991
- The perfectly matchable subgraph polytope of a bipartite graphNetworks, 1983
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965