Abstract
Gomory's cutting-plane technique can be viewed as a recursive procedure for proving the validity of linear inequalities over the set of all integer vectors in a prescribed polyhedron. The number of rounds of cutting planes needed to obtain all valid linear inequalities is known as the rank of the polyhedron. We prove that polyhedra featured in popular formulations of the stable-set problem, the set-covering problem, the set-partitioning problem, the knapsack problem, the bipartite-subgraph problem, the maximum-cut problem, the acyclic-subdigraph problem, the asymmetric traveling-salesman problem, and the traveling-salesman problem have arbitrarily high rank. In particular, we prove conjectures of Barahona, Grötschel, and Mahjoub; Chvátal; Grötschel and Pulleyblank; and Jünger.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
