On the Chvátal Rank of Certain Inequalities
- 30 April 1999
- book chapter
- Published by Springer Nature
- p. 218-233
- https://doi.org/10.1007/3-540-48777-8_17
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Bounds on the Chvátal Rank of Polytopes in the 0/1-CubePublished by Springer Nature ,1999
- Ladders for Travelling SalesmenSIAM Journal on Optimization, 1995
- Clique tree inequalities define facets of the asymmetric traveling salesman polytopeDiscrete Applied Mathematics, 1995
- A lift-and-project cutting plane algorithm for mixed 0–1 programsMathematical Programming, 1993
- Optimizing over the subtour polytope of the travelling salesman problemMathematical Programming, 1990
- Facets of the three-index assignment polytopeDiscrete Applied Mathematics, 1989
- On cutting-plane proofs in combinatorial optimizationLinear Algebra and its Applications, 1989
- Brick decompositions and the matching rank of graphsCombinatorica, 1982
- On stable set polyhedra for K1,3-free graphsJournal of Combinatorial Theory, Series B, 1981
- On Cutting PlanesPublished by Elsevier ,1980