A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube
[chapter]
1999
Lecture Notes in Computer Science
Gomory's and Chvátal's cutting-plane procedure proves recursively the validity of linear inequalities for the integer hull of a given polyhedron. The Chvátal rank of the polyhedron is the number of rounds needed to obtain all valid inequalities. It is well known that the Chvátal rank can be arbitrarily large, even if the polyhedron is bounded, if it is 2dimensional, and if its integer hull is a 0/1-polytope. We show that the Chvátal rank of polyhedra featured in common relaxations of many
doi:10.1007/3-540-48777-8_11
fatcat:x3m6vjusmrbpdokawg4xsvdtye