On the rank of mixed 0,1 polyhedra?

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

Volumn 2081, Issue , 2001, Pages 71-77

  Cornuéjols, Gérard ^a   Li, Yanjun ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; GEOMETRY;

BINARY VARIABLES; LOWER BOUNDS; MIXED-INTEGER CUTS; POLYTOPES; UPPER AND LOWER BOUNDS; UPPER BOUND;

INTEGER PROGRAMMING;

EID: 26344442759     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45535-3_6     Document Type: Conference Paper

References (17)

1. Balas, E.: Disjunctive programming: Cutting planes from logical conditions. In: Mangasarian, O., et al. (eds.): Nonlinear Programming, Vol. 2. Academic Press, New York (1975) 279-312
2. Balas, E.: Disjunctive programming. Annals of Discrete Mathematics 5 (1979) 3-51
3. Balas, E., Ceria, S., Cornuéjols, G.: A lift-and-project cutting plane algorithm for mixed 0-1 programs. Mathematical Programming 58 (1993) 295-324
4. Balas, E., Perregaard, M.: A Precise correspondence between lift-and-project cuts, simple disjunctive cuts and mixed integer Gomory cuts for 0-1 programming. Management Science Research Report MSRR-631, Carnegie Mellon University (2000)
5. Chvátal, V.: Edmonds polytopes and a hierarchy of combinatorial optimization. Discrete Mathematics 4 (1973) 305-337
6. Chvátal, V., Cook, W., Hartmann, M.: On cutting-plane proofs in combinatorial optimization. Linear Algebra and its Applications 114 115 (1989) 455-499
7. Cook, W., Cunningham, W., Pullyblank, W., and Schrijver, A.: Combinatorial Optimization. John Wiley, New York (1998).
8. Cook, W., Dash, S.: On the matrix-cut rank of polyhedra. preprint, Department of Computational and Applied Mathematics, Rice University, Houston, Texas (1999), to appear in Mathematics of Operations Research.
9. Cook, W., Kannan, R., Schrijver, A.: Chvátal closures for mixed integer programming problems. Mathematical Programming 47 (1990) 155-174
10. Cornuéjols, G., Li, Y.: Elementary closures for integer programs. Operations Research Letters 28 (2001) 1-8
11. Eisenbrand, F., Schulz, A.: Bounds on the Chvátal rank of polytopes in the 0=1-cube. In: Cornuéjols, G., et al, (eds.): Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, 1610 (1999) 137-150
12. Goemans, M., Tuncel, L.: When does the positive semideniteness constraint help in lifting procedures. preprint, Department of Combinatorics and Optimization, University of Waterloo, Ontario, Canada (2000), to appear in Mathematics of Operations Research.
13. Gomory, R.: An algorithm for the mixed integer problem. Technical Report RM-2597, The RAND Corporation (1960)
14. Li, Y.: Bounds on the ranks of polytopes in the 0=1-cube. Research report, Carnegie Mellon University (2000), submitted.
15. Lovász, L., Schrijver, A.: Cones of matrices and set-functions and 0-1 optimization. SIAM Journal of Optimization 1 (1991) 166-190
16. Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. John Wiley and Sons, New York (1988)
17. Nemhauser, G., Wolsey, L.: A recursive procedure to generate all cuts for 0-1 mixed integer programs. Mathematical Programming 46 (1990) 379-390