Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube
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 number of rounds needed to obtain all valid inequalities is known as the Chvátal rank of the polyhedron. It is well-known that the Chvátal rank can be arbitrarily large, even if the polyhedron is bounded, if it is of dimension 2, and if its integer hull is a 0/1-polytope. We prove that the Chvátal rank of polyhedra featured in common relaxations of many combinatorial optimization problems is rather small; in fact, the rank of any polytope contained in the n-dimensional 0/1-cube is at most 3n2 lg n. This improves upon a recent result of Bockmayr et al.  who obtained an upper bound of O(n3 lg n).
Moreover, we refine this result by showing that the rank of any polytope in the 0/1-cube that is defined by inequalities with small coefficients is O(n). The latter observation explains why for most cutting planes derived in polyhedral studies of several popular combinatorial optimization problems only linear growth has been observed (see, e.g., ); the coefficients of the corresponding inequalities are usually small. Similar results were only known for monotone polyhedra before.
Finally, we provide a family of polytopes contained in the 0/1-cube the Chvátal rank of which is at least (1+∈)n for some ∈ > 0; the best known lower bound was n.
Unable to display preview. Download preview PDF.
- A. Bockmayr and F. Eisenbrand. On the Chvátal rank of polytopes in the 0/1 cube. Research Report MPI-I-97-2-009, Max-Planck-Institut für Informatik, September 1997.Google Scholar
- A. Bockmayr, F. Eisenbrand, M. E. Hartmann, and A. S. Schulz. On the Chvátal rank of polytopes in the 0/1 cube. Technical Report 616, Technical University of Berlin, Department of Mathematics, December 1998.Google Scholar
- W. Cook, W. H. Cunningham, W. R. Pulleyblank, and A. Schrijver. Combinatorial Optimization. John Wiley, 1998.Google Scholar
- F. Eisenbrand. A note on the membership problem for the first elementary closure of a polyhedron. Technical Report 605, Technical University of Berlin, Department of Mathematics, November 1998. To appear in Combinatorica.Google Scholar
- M. Fischetti. Three facet lifting theorems for the asymmetric traveling salesman polytope. In E. Balas, G. Cournuéjols, and R. Kannan, editors, Integer Programming and Combinatorial Optimization, pages 260–273. Proceedings of the 2nd IPCO Conference, 1992.Google Scholar
- T. Fleiner, V. Kaibel, and G. Rote. Upper bounds on the maximal number of facets of 0/1-polytopes. Technical Report 98-327, University of Cologne, Department of Computer Science, 1998. To appear in European Journal of Combinatorics.Google Scholar
- R. E. Gomory. An algorithm for integer solutions to linear programs. In R. L. Graves and P. Wolfe, editors, Recent Advances in Mathematical Programming, pages 269–302. McGraw-Hill, 1963.Google Scholar
- M. Grötschel and M. W. Padberg. Polyhedral theory. In E. L. Lawler, J. K. Lenstra, A. H. G. Rinnoy Kan, and D. B. Shmoys, editors, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, pages 251–305. John Wiley, 1985.Google Scholar
- M. E. Hartmann. Cutting planes and the complexity of the integer hull. Technical Report 819, School of Operations Research and Industrial Engineering, Cornell University, September 1988.Google Scholar
- M. E. Hartmann. Personal communication, March 1998.Google Scholar
- M. E. Hartmann, M. Queyranne, and Y. Wang. On the Chvátal rank of certain inequalities. This volume, 1999.Google Scholar
- R. Impagliazzo, T. Pitassi, and A. Urquhart. Upper and lower bound for tree-like cutting plane proofs. In Proc. Logic in Computer Science, LICS’94, Paris, 1994.Google Scholar
- M. W. Padberg and M. Grötschel. Polyhedral computations. In E. L. Lawler, J. K. Lenstra, A. H. G. Rinnoy Kan, and D. B. Shmoys, editors, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, pages 307–360. John Wiley, 1985.Google Scholar
- W. R. Pulleyblank. Polyhedral combinatorics. In G. L. Nemhauser, A. H. G. Rinnooy Kan, and M. J. Todd, editors, Optimization, Volume 1 of Handbooks in Operations Research and Management Science, Chapter V, pages 371–446. Elsevier, 1989.Google Scholar
- A. Schrijver. Theory of Linear and Integer Programming. John Wiley, 1986.Google Scholar
- A. S. Schulz. A simple proof that the Chvátal rank of polytopes in the 0/1-cube is small. Unpublished manuscript, September 1997.Google Scholar
- A. S. Schulz, R. Weismantel, and G. M. Ziegler. An optimization problem is ten problems. In preparation.Google Scholar