Optimizing over the first Chvátal closure
- 15 December 2006
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 110 (1) , 3-20
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On the MIR Closure of Polyhedra2007
- Projected Chvátal–Gomory cuts for mixed integer linear programsMathematical Programming, 2006
- Optimizing over the split closureMathematical Programming, 2006
- On the separation of split cuts and related inequalitiesMathematical Programming, 2003
- NOTE - On the Membership Problem for the Elementary Closure of a PolyhedronCombinatorica, 1999
- A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facetsMathematical Programming, 1993
- The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed GraphSIAM Journal on Discrete Mathematics, 1989
- Edmonds polytopes and a hierarchy of combinatorial problemsDiscrete Mathematics, 1973
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Outline of an algorithm for integer solutions to linear programsBulletin of the American Mathematical Society, 1958