Subset algebra lift operators for 0-1 integer programming

SIAM Journal on Optimization

Volumn 15, Issue 1, 2005, Pages 63-95

  Bienstock, Daniel ^a   Zuckerberg, Mark ^a  

^a Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

Disjunctive methods; Integer programming; Lift and project

Indexed keywords

DISJUNCTIVE METHODS; ITERATIONS; LIFT-AND-PROJECT; POLYNOMIAL TIME;

ALGEBRA; ALGORITHMS; FUNCTIONS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

MATHEMATICAL OPERATORS;

EID: 14944344548     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623402420346     Document Type: Article

References (30)

1. E. BALAS, Disjunctive programs: Cutting planes from logical conditions, in Nonlinear Programming 2, O. L. Mangasarian, R. R. Meyer, and S. M. Robinson, eds., Academic Press, New York, 1975, pp. 279-312.
2. E. BALAS, Disjunctive Programming, Ann. Discrete Math., 5 (1979), pp. 3-51.
3. E. BALAS, S. CERIA, AND G. CORNUÉJOLS, A lift-ana-project cutting plane algorithm for mixed 0-1 programs, Math. Program., 58 (1993), pp. 295-324.
4. E. BALAS, S. CERIA, AND G. CORNUÉJOLS, Mixed 0-1 programming by lift-and-project in a branch-and-cut framework, Management Sci., 42 (1996), pp. 1229-1246.
5. E. BALAS AND S. M. NG, On the set covering polytope: I. All the facets with coefficients in {0, 1, 2}, Math. Program., 45 (1989), pp. 1-20.
6. W. COOK AND S. DASH, On the matrix-cut rank of polyhedra, Math. Oper. Res., 26 (2001), pp. 19-30.
7. E. BALAS AND W. PULLEYBLANK, The perfect matchable subgraph polytope of a bipartite graph, Networks, 13 (1983), pp. 495-516.
8. E. BALAS AND W. PULLEYBLANK, The perfect matchable subgraph polytope of an arbitrary graph, Combinatorica, 9 (1989), pp. 321-327.
9. F. BARAHONA, Reducing matching to polynomial size linear programming, SIAM J. Optim., 3 (1993), pp. 688-695.
10. D. BIENSTOCK AND M. ZUCKERBERG, Subset Algebra Lift Operators for 0-1 Integer Programming, CORC report TR-2002-01, Computational Optimization Research Center, Columbia University, New York, 2002. Available online at www.corc.ieor. columbia.edu/reports/techreports.html (extended version).
11. D. BIENSTOCK AND M. ZUCKERBERG, Approximate Fixed-Rank Closures of Covering Problems, CORC report TR-2003-01, Computational Optimization Research Center, Columbia University, New York, 2003. Available online at www.corc.ieor.columbia.edu/reports/techreports.html.
12. E. BOROS AND P. L. HAMMER, Pseudo-Boolean optimization, Discrete Appl. Math., 123 (2002), pp. 155-225.
13. V. CHVÁTAL, W. COOK, AND M. HARTMANN, On cutting-plane proofs in combinatorial optimization, Linear Algebra Appl., 114 (1989), pp. 455-499.
14. L. COMTET, Advanced Combinatorics: The Art of Finite and Infinite Expansions, D. Reidel, Dordrecht, The Netherlands, 1974.
15. G. CORNUÉJOLS AND Y. LI, On the rank of mixed 0,1 polyhedra, Math. Program., 91 (2002), pp. 391-397.
16. G. CORNUÉJOLS AND Y. LI, Elementary closures for integer programs, Oper. Res. Lett., 28 (2001), pp. 1-8.
17. M. DEZA AND M. LAURENT, Geometry of Cuts and Metrics, Springer-Verlag, Berlin, 1997.
18. W. FELLER, An Introduction to Probability Theory and Its Applications, Wiley, New York, 1966.
19. M. X. GOEMANS AND L. TUNÇEL, When does the positive semidefiniteness constraint help in lifting procedures?, Math. Oper. Res., 26 (2001), pp. 796-815.
20. J. HOOKER, Logic, optimization and constraint programming, INFORMS J. Comput., 14 (2002), pp. 295-321.
21. U.-U. HAUS, M. KÖPPE, AND R. WEISMANTEL, The integral basis method for integer programming, Math. Methods Oper. Res., 3 (2001), pp. 353-361.
22. J. B. LASSERRE, An explicit exact SDP relaxation for nonlinear 0-1 programs, in Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 2081, K. Aardal and A. M. H. Gerards, eds., Springer, Berlin, 2001, pp. 293-303.
23. L. LOVÁSZ AND A. SCHRIJVER, Cones of matrices and set-functions and 0-1 optimization, SIAM J. Optim., 1 (1991), pp. 166-190.
24. M. LAURENT, A comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre relaxations for 0-1 programming, Math. Oper. Res., 28 (2003), pp. 470-496.
25. M. LAURENT, Lower bound for the number of iterations in semidefinite relaxations for the cut polytope, Math. Oper. Res., 28 (2003), pp. 871-883.
26. A. N. LETCHFORD, On disjunctive cuts for combinatorial optimization, J. Comb. Optim., 5 (2001), pp. 299-315.
27. G. NEMHAUSER AND L. A. WOLSEY, Integer and Combinatorial Optimization, Wiley, New York, 1988.
28. G.-C. ROTA, On the foundations of combinatorial theory I. Theory of Möbius functions, Z. Wahrsch. Verw. Gebiete, 2 (1964), pp. 340-368.
29. H. D. SHERALI AND W. P. ADAMS, A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems, SIAM J. Discrete Math., 3 (1990), pp. 411-430.
30. M. ZUCKERBERG, A Set Theoretic Approach to Lifting Procedures for 0,1 Integer Programming, Ph.D. Thesis, Columbia University, New York, 2004.