On the rank of mixed 0,1 polyhedra

Mathematical Programming, Series B

Volumn 91, Issue 2, 2002, Pages 391-397

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

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Disjunctive cut; Mixed 0,1 program; Mixed integer cut; Rank; Split cut

Indexed keywords

INTEGER PROGRAMMING; NUMERICAL METHODS;

DISJUNCTIVE CUT; MIXED 0,1 PROGRAM; MIXED INTEGER CUT; RANK; SPLIT CUT;

GEOMETRY;

EID: 4243301673     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070100250     Document Type: Article

References (16)

1. Balas, E. (1975): Disjunctive programming: cutting planes from logical conditions. In: Mangasarian, O.L. et al. (eds.) Nonlinear Programming. Vol.2. Academic Press, New York, pp. 279-312
2. Balas, E. (1979): Disjunctive programming. Ann. Discrete Math. 5, 3-51
3. Balas, E., Ceria, S., Cornuéjols, G. (1993): A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Program. 58, 295-324
4. Balas, E., Perregaard, M. (2000): 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
5. Chvátal, V. (1973): Edmonds polytopes and a hierarchy of combinatorial optimization. Discrete Math. 4, 305-337
6. Chvátal, V., Cook, W., Hartmann, M. (1989): On cutting-plane proofs in combinatorial optimization. Linear Algebra Appl. 114/115, 455-199
7. Cook, W., Cunningham, W., Pullyblank, W., Schrijver, A. (1998): Combinatorial Optimization. Wiley, New York
8. Cook, W., Dash, S. (2001): On the matrix-cut rank of polyhedra. Math. Oper. Res. 26, 19-30
9. Cook, W., Kannan, R., Schrijver, A. (1990): Chvátal closures for mixed integer programming problems. Math. Program. 47, 155-174
10. Cornuejols, G., Li, Y. (2001): Elementary closures for integer programs. Oper. Res. Lett. 28, 1-8
11. Eisenbrand, F., Schulz, A. (1999): 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. 7th International IPCO Conference, Graz Austria, Lecture Notes in Computer Science 1610, 137-150
12. Goemans, M., Tuncel, L. (2000): When does the positive semidefiniteness constraint help in lifting procedures. Preprint. Department of Combinatorics and Optimization, University of Waterloo, Ontario, Canada, to appear in Math. Oper. Res.
13. Gomory, R. (1960): An algorithm for the mixed integer problem. Technical Report RM-2597, The RAND Corporation
14. Lovász, L., Schrijver, A. (1991): Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. 1, 166-190
15. Nemhauser, G., Wolsey, L. (1988): Integer and combinatorial optimization. Wiley, New York
16. Nemhauser, G., Wolsey, L. (1990): A recursive procedure to generate all cuts for 0-1 mixed integer programs. Math. Program. 46, 379-390