On the chvátal rank of certain inequalities

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1610, Issue , 1999, Pages 218-233

  Hartmann, Mark ^a   Queyranne, Maurice ^b   Wang, Yaoguang ^c  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^c PeopleSoft Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; LINEAR PROGRAMMING;

CUTTING PLANES; INTEGRAL COMPONENTS; INTEGRAL PART; LINEAR PROGRAMS; OPTIMUM VALUE; POLYTOPES; TRAVELLING SALESMAN;

INTEGER PROGRAMMING;

EID: 22644450457     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48777-8_17     Document Type: Conference Paper

References (26)

1. 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.
2. E. Balas and M.J. Saltzman (1989), “Facets of the three-index assignment polytope,” Discrete Applied Mathematics 23, 201-229.
3. 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.
4. S.C. Boyd and W.H. Cunningham (1991), “Small travelling salesman polytopes,” Mathematics of Operations Research 16, 259-271.
5. S.C. Boyd, W.H. Cunningham, M. Queyranne and Y. Wang (1995), “Ladders for travelling salesmen,” SIAM Journal on Optimization 5, 408-420.
6. S.C. Boyd and W.R. Pulleyblank (1991), “Optimizing over the subtour polytope of the travelling salesman problem,” Mathematical Programming 49, 163-187.
7. A. Caprara and M. Fischetti (1996), “0-1/2 Chvátal-Gomory cuts,” Mathematical Programming 74, 221-236.
8. A. Caprara, M. Fischetti and A.N. Letchford (1997), “On the separation of maximally violated mod-fc cuts,” DEIS-OR Technical Report OR-97-8, Dipartimento di Elettronica, Informatica e Sistemistica Università degli Studi di Bologna, Italy, May 1997.
9. S. Ceria (1993), “Lift-and-project methods for mixed 0-1 programs,” Ph.D. dissertation, Carnegie-Mellon University.
10. V. Chvátal (1973), “Edmonds polytopes and a hierarchy of combinatorial problems,” Discrete Mathematics 4, 305-337.
11. 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.
12. 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.
13. J. Edmonds, L. Lovász and W.R. Pulleyblank (1982), “Brick decompositions and the matching rank of graphs,” Combinatorica 2, 247-274.
14. 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.
15. F. Eisenbrand and A.S. Schulz (1999), “ Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube”, this Volume.
16. 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.
17. M. Fischetti (1995), “Clique tree inequalities define facets of the asymmetric travelling salesman polytope,” Discrete Applied Mathematics 56, 9-18.
18. 1,3-free graphs,” Journal of Combinatorial Theory Ser. B 31, 313-326.
19. 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.
20. M. Grötschel and W.R. Pulleyblank (1986), “Clique tree inequalities and the symmetric travelling salesman problem,” Mathematics of Operations Research 11, 537-569.
21. M. Hartmann (1988), “Cutting planes and the complexity of the integer hull,” Ph.D. thesis, Cornell University.
22. E.L. Johnson (1965), “Programming in networks and graphs”, Research Report ORC 65-1, Operations Research Center, University of California-Berkeley.
23. G.L. Nemhauser and L.A. Wolsey (1988), Integer and, Combinatorial Optimization, Wiley, New York.
24. M. Queyranne and Y. Wang (1995), “Symmetric inequalities and their composition for asymmetric travelling salesman polytopes,” Mathematics of Operations Research 20, 838-863.
25. A. Schrijver (1980), “On cutting planes,” in: M. Deza and I.G. Rosenberg, eds., Combinatorics 79 Part II, Ann. Discrete Math. 9, 291-296.
26. A. Schrijver (1986), Theory of Linear and, Integer Programming, Wiley, Chichester.