On the Chvátal rank of polytopes in the 0/1 cube
- 1 October 1999
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 98 (1-2) , 21-27
- https://doi.org/10.1016/s0166-218x(99)00156-0
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Edmonds polytopes and a hierarchy of combinatorial problemsPublished by Elsevier ,2002
- On the Chvátal Rank of Certain InequalitiesPublished by Springer Nature ,1999
- On the complexity of branch and cut methods for the traveling salesman problemPublished by American Mathematical Society (AMS) ,1991
- On cutting-plane proofs in combinatorial optimizationLinear Algebra and its Applications, 1989
- Integer and Combinatorial OptimizationPublished by Wiley ,1988
- Sensitivity theorems in integer linear programmingMathematical Programming, 1986
- On Cutting PlanesPublished by Elsevier ,1980