Abstract
The Chvátal rank of an inequality ax ≤ b with integral components and valid for the integral hull of a polyhedron P, is the minimum number of rounds of Gomory-Chvátal cutting planes needed to obtain the given inequality. The Chvátal rank is at most one if b is the integral part of the optimum value z(a) of the linear program max {ax : x ∈ P}. We show that, contrary to what was stated or implied by other authors, the converse to the latter statement, namely, the Chvátal rank is at least two if b is less than the integral part of z(a), is not true in general. We establish simple conditions for which this implication is valid, and apply these conditions to several classes of facet-inducing inequalities for travelling salesman polytopes.
Research supported by grants from the Natural Sciences and Engineering Research Council (NSERC) of Canada
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
E. Balas, S. Ceria and G. Cornuéjols (1993), “A lift-and-project cutting plane algorithm for mixed 0–1 programs,” Mathematical Programming 58, 295–324.
E. Balas and M.J. Saltzman (1989), “Facets of the three-index assignment polytope,” Discrete Applied Mathematics 23, 201–229.
A. Bockmayr, F. Eisenbrand, M. Hartmann and A.S. Schulz (to appear), “On the Chvátal rank of polytopes in the 0/1 cube,” to appear in Discrete Applied Mathematics.
S.C. Boyd and W.H. Cunningham (1991), “Small travelling salesman polytopes,” Mathematics of Operations Research 16, 259–271.
S.C. Boyd, W.H. Cunningham, M. Queyranne and Y. Wang (1995), “Ladders for travelling salesmen,” SIAM Journal on Optimization 5, 408–420.
S.C. Boyd and W.R. Pulleyblank (1991), “Optimizing over the subtour polytope of the travelling salesman problem,” Mathematical Programming 49, 163–187.
A. Caprara and M. Fischetti (1996), “0–1/2 Chvátal-Gomory cuts,” Mathematical Programming 74, 221–236.
A. Caprara, M. Fischetti and A.N. Letchford (1997), “On the separation of maximally violated mod-k cuts,” DEIS-OR Technical Report OR-97-8, Dipartimento di Elettronica, Informatica e Sistemistica Università degli Studi di Bologna, Italy, May 1997.
S. Ceria (1993), “Lift-and-project methods for mixed 0–1 programs,” Ph.D. dissertation, Carnegie-Mellon University.
V. Chvátal (1973), “Edmonds polytopes and a hierarchy of combinatorial problems,” Discrete Mathematics 4, 305–337.
V. Chvátal, W. Cook and M. Hartmann (1989), “On cutting-plane proofs in combinatorial optimization,” Linear Algebra and Its Applications 114/115, 455–499.
P.D. Domich, R. Kannan and L.E. Trotter, Jr. (1987), “Hermite normal form computation using modulo determinant arithmetic,” Mathematics of Operations Research 12, 50–59.
J. Edmonds, L. Lovász and W.R. Pulleyblank (1982), “Brick decompositions and the matching rank of graphs,” Combinatorica 2, 247–274.
F. Eisenbrand (1998), “A note on the membership problem for the elementary closure of a polyhedron,” Preprint TU-Berlin No. 605/1998, Fachbereich Mathematik, Technische Universität Berlin, Germany, November 1998.
F. Eisenbrand and A.S. Schulz (1999), “Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube”, this Volume.
M. Fischetti (1992), “Three facet-lifting theorems for the asymmetric traveling salesman polytope”, pp. 260–273 in E. Balas, G. Cornuéjols and R. Kannan, eds, Integer Programming and Combinatorial Optimization (Proceedings of the IPCO2 Conference), G.S.I.A, Carnegie Mellon University.
M. Fischetti (1995), “Clique tree inequalities define facets of the asymmetric travelling salesman polytope,” Discrete Applied Mathematics 56, 9–18.
R. Giles and L.E. Trotter, Jr. (1981), “On stable set polyhedra for K 1,3-free graphs,” Journal of Combinatorial Theory Ser. B 31, 313–326.
M. Grötschel and M.W. Padberg (1985), “Polyhedral theory,” pp. 251–305 in: E.L. Lawler et al., eds., The Travelling Salesman Problem, Wiley, New York.
M. Grötschel and W.R. Pulleyblank (1986), “Clique tree inequalities and the symmetric travelling salesman problem,” Mathematics of Operations Research 11, 537–569.
M. Hartmann (1988), “Cutting planes and the complexity of the integer hull,” Ph.D. thesis, Cornell University.
E.L. Johnson (1965), “Programming in networks and graphs”, Research Report ORC 65-1, Operations Research Center, University of California-Berkeley.
G.L. Nemhauser and L.A. Wolsey (1988), Integer and Combinatorial Optimization, Wiley, New York.
M. Queyranne and Y. Wang (1995), “Symmetric inequalities and their composition for asymmetric travelling salesman polytopes,” Mathematics of Operations Research 20, 838–863.
A. Schrijver (1980), “On cutting planes,” in: M. Deza and I.G. Rosenberg, eds., Combinatorics 79 Part II, Ann. Discrete Math. 9, 291–296.
A. Schrijver (1986), Theory of Linear and Integer Programming, Wiley, Chichester.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hartmann, M., Queyranne, M., Wang, Y. (1999). On the Chvátal Rank of Certain Inequalities. In: Cornuéjols, G., Burkard, R.E., Woeginger, G.J. (eds) Integer Programming and Combinatorial Optimization. IPCO 1999. Lecture Notes in Computer Science, vol 1610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48777-8_17
Download citation
DOI: https://doi.org/10.1007/3-540-48777-8_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66019-4
Online ISBN: 978-3-540-48777-7
eBook Packages: Springer Book Archive