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 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 2-dimensional, 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 combinatorial optimization problems is rather small; in fact, we prove that the rank of every polytope contained in the n-dimensional 0/1-cube is at most n ²(1+log n). Moreover, we also demonstrate that the rank of any polytope in the 0/1-cube whose integer hull is defined by inequalities with constant coefficients is 0(n). Finally, we provide a family of polytopes contained in the 0/1-cube whose Chvátal rank is at least (1+e)n, for some ε>0.