Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube
- 30 April 1999
- book chapter
- Published by Springer Nature
- p. 137-150
- https://doi.org/10.1007/3-540-48777-8_11
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Edmonds polytopes and a hierarchy of combinatorial problemsPublished by Elsevier ,2002
- Lower bounds for cutting planes proofs with small coefficientsThe Journal of Symbolic Logic, 1997
- Anti-Hadamard Matrices, Coin Weighing, Threshold Gates, and Indecomposable HypergraphsJournal of Combinatorial Theory, Series A, 1997
- Gomory cuts revisitedOperations Research Letters, 1996
- Ladders for Travelling SalesmenSIAM Journal on Optimization, 1995
- Small Travelling Salesman PolytopesMathematics of Operations Research, 1991
- Optimizing over the subtour polytope of the travelling salesman problemMathematical Programming, 1990
- Facets of the three-index assignment polytopeDiscrete Applied Mathematics, 1989
- Facets of the Bipartite Subgraph PolytopeMathematics of Operations Research, 1985
- Flip-Flops in Hypohamiltonian GraphsCanadian Mathematical Bulletin, 1973