Bounds on the chvátal rank of polytopes in the 0/1-cube

Combinatorica

Volumn 23, Issue 2, 2003, Pages 245-261

  Eisenbrand, Friedrich ^a   Schulz, Andreas S ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0141543721     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-003-0020-5     Document Type: Article

References (46)

1. N. ALON and V. H. Vu: Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs, Journal of Combinatorial Theory 79A 133-160, 1997.
2. E. BALAS, S. CERIA, G. CORNUÉJOLS, and N. R. NATRAJ: Gomory cuts revisited, Operations Research Letters 19 1-9, 1996.
3. E. BALAS and M. J. SALTZMAN: Facets of the three-index assignment polytope, Discrete Applied Mathematics 23 201-229, 1989.
4. F. BARAHONA, M. GRÖTSCHEL, and A. R. MAHJOUB: Facets of the bipartite subgraph polytope, Mathematics of Operations Research 10 340-358, 1985.
5. 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.
6. A. BOCKMAYR and F. EISENBRAND: Cutting planes and the elementary closure in fixed dimension, Mathematics of Operations Research 26 304-312, 2001.
7. A. BOCKMAYR, F. EISENBRAND, M. E. HARTMANN, and A. S. SCHULZ: On the Chvátal rank of polytopes in the 0/1 cube, Discrete Applied Mathematics 98 21-27, 1999.
8. M. BONET, T. PITASSI, and R. RAZ: Lower bounds for cutting planes proofs with small coefficients, Journal of Symbolic Logic 62 708-728, 1997.
9. S. C. BOYD and W. H. CUNNINGHAM: Small travelling salesman polytopes, Mathematics of Operations Research 16 259-271, 1991.
10. S. C. BOYD, W. H. CUNNINGHAM, M. QUEYRANNE, and Y. WANG: Ladders for travelling salesmen, SIAM Journal on Optimization 5 408-420, 1995.
11. S. C. BOYD and W. R. PULLEYBLANK: Optimizing over the subtour polytope of the travelling salesman problem, Mathematical Programming 49 163-187, 1991.
12. V. CHVÁTAL: Edmonds polytopes and a hierarchy of combinatorial problems, Discrete Mathematics 4 305-337, 1973.
13. V. CHVÁTAL: Flip-flops in hypohamiltonian graphs, Canadian Mathematical Bulletin 16 33-41, 1973.
14. V. CHVÁTAL, W. COOK, and M. HARTMANN: On cutting-plane proofs in combinatorial optimization, Linear Algebra and its Applications 114/115 455-499, 1989.
15. W. COOK, C. R. COULLARD, and GY. TURÁN: On the complexity of cutting plane proofs, Discrete Applied Mathematics 18 25-38, 1987.
16. W. COOK, W. H. CUNNINGHAM, W. R. PULLEYBLANK, and A. SCHRIJVER: Combinatorial Optimization, John Wiley, 1998.
17. W. J. COOK and S. DASH: On the matrix-cut rank of polyhedra, Mathematics of Operations Research 26 19-30, 2001.
18. G. CORNUÉJOLS and Y. Li: On the rank of mixed 0,1 polyhedra, Mathematical Programming 91 391-397, 2002.
19. F. EISENBRAND: On the membership problem for the elementary closure of a polyhedron, Combinatorica 19 297-300, 1999.
20. F. EISENBRAND and A. S. SCHULZ: Bounds on the Chvátal rank of polytopes in the 0/1-cube, In: G. Cornuéjols, R. E. Burkard, and G. J. Woeginger, editors, Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, 1610 137-150, 1999.
21. P. ERDÖS: On circuits and subgraphs of chromatic graphs, Mathematika 9 170-175, 1962.
22. M. FISCHETTI: Three facet lifting theorems for the asymmetric traveling salesman polytope, In: E. Balas, G. Cornuéjols, and R. Kantian, editors, Integer Programming and Combinatorial Optimization, pages 260-273, Proceedings of the 2nd IPCO Conference, 1992.
23. T. FLEINER, V. KAIBEL, and G. ROTE: Upper bounds on the maximal number of facets of 0/1-polytopes, European Journal of Combinatorics 21 121-130, 2000.
24. 1,3-free graphs, Journal of Combinatorial Theory 31 313-326, 1981.
25. R. E. GOMORY: Outline of an algorithm for integer solutions to linear programs, Bulletin of the American Mathematical Society 64 275-278, 1958.
26. R. E. GOMORY: Solving linear programming problems in integers, In: R. Bellman and M. Hall, editors, Proceedings of Symposia in Applied Mathematics X, pages 211-215, American Mathematical Society, 1960.
27. 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.
28. 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.
29. M. GRÖTSCHEL and W.R. PULLEYBLANK: Clique tree inequalities and the symmetric travelling salesman problem, Mathematics of Operations Research 11 537-569, 1986.
30. A. HAKEN: The intractability of resolution, Theoretical Computer Science 39 297-308, 1985.
31. P. L. HAMMER, E. JOHNSON, and U. N. PELED: Facets of regular 0-1 polytopes, Mathematical Programming 8 179-206, 1975.
32. M. HARTMANN: Cutting planes and the complexity of the integer hull, Technical Report 819, School of Operations Research and Industrial Engineering, Cornell University, September 1988.
33. M. E. HARTMANN: Personal communication, March 1998.
34. M. E. HARTMANN, M. QUEYRANNE, and Y. WANG: On the Chvátal rank of certain inequalities, In: G. Cornuéjols, R. E. Burkard, and G. J. Woeginger, editors, Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, 1610 218-233, 1999.
35. R. IMPAGLIAZZO, T. PITASSI, and A. URQUHART: Upper and lower bounds for tree-like cutting plane proofs, In Proceedings of the IEEE Symposium on Logic in Computer Science, pages 220-228, 1994.
36. U. H. KORTENKAMP, J. RlCHTER-GEBERT, A. SARANGARAJAN, and G. M. ZlEGLER: Extremal properties of 0/1-polytopes, Discrete and Computational Geometry 17 439-448, 1997.
37. Y. Li: Upper bounds on the Chvátal ranks of polytopes, Working Paper # 2001-E26, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA, November 2000.
38. D. NADDEF: The Hirsch conjecture is true for (0,1)-polytopes, Mathematical Programming 45 109-110, 1989.
39. 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.
40. P. PUDLÁK: Lower bounds for resolution and cutting plane proofs and monotone computations, Journal of Symbolic Logic 62 981-988, 1997.
41. W. R. PULLEYBLANK: Polyhedral combinatorics, In: G. L. Nemhauser, A. H. G. Rinnoy Kan, and M. J. Todd, editors, Optimization, Volume 1 of Handbooks in Operations Research and Management Science, Chapter V, pages 371-446, Elsevier, 1989.
42. A. SCHRIJVER: On cutting planes, Annals of Discrete Mathematics 9 291-296, 1980.
43. A. SCHRIJVER: Theory of Linear and Integer Programming, John Wiley, 1986.
44. A. S. SCHULZ: Polytopes and Scheduling, PhD thesis, Technische Universität Berlin, Germany, 1996.
45. A. S. SCHULZ: A simple proof that the Chvátal rank of polytopes in the 0/1-cube is small, Unpublished manuscript, September 1997.
46. A. S. SCHULZ, R. WEISMANTEL, and G. M. ZIEGLER: 0/1-integer programming: Optimization and augmentation are equivalent, In: P. Spirakis, editor, Algorithms-ESA '95, Lecture Notes in Computer Science, 979 473-483, 1995.