Solving lift-and-project relaxations of binary integer programs

SIAM Journal on Optimization

Volumn 16, Issue 3, 2006, Pages 726-750

  Burer, Samuel ^a   Vandenbussche, Dieter ^b  

^a UNIVERSITY OF IOWA   (United States)

^b United States of America   (United States)

Author keywords

Augmented Lagrangian; Integer programming; Lift and project relaxations; Semidefinite programming

Indexed keywords

AUGMENTED LAGRANGIAN; LIFT-AND-PROJECT RELAXATIONS; SEMIDEFINITE PROGRAMMING;

ALGORITHMS; COMPUTATION THEORY; GRADIENT METHODS; OPTIMIZATION; RELAXATION PROCESSES;

INTEGER PROGRAMMING;

EID: 33747195800     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/040609574     Document Type: Article

References (41)

1. E. ANDERSON, Z. BAI, C. BISCHOF, S. BLACKFORD, J. DEMMEL, J. DONGARRA, J. DU CROZ, A. GREENBAUM, S. HAMMARLING, A. MCKENNEY, AND D. SORENSEN, LAPACK Users' Guide, 3rd ed., Society for Industrial and Applied Mathematics, Philadelphia, 1999.
2. K. M. ANSTREICHER, Recent advances in the solution of quadratic assignment problems, Math. Program., 97 (2003), pp. 27-42.
3. E. BALAS, Disjunctive programming, Ann. Discrete Math., 5 (1979), pp. 3-51.
4. E. BALAS, S. CERIA, AND G. CORNUÉJOLS, A lift-and-project cutting plan algorithm for mixed 0-1 programs, Math. Program., 58 (1993), pp. 295-324.
5. F. BARAHONA AND R. ANBIL, The volume algorithm: Producing primal solutions with a subgradient method, Math. Program., 87 (2000), pp. 385-399.
6. D. P. BERTSEKAS, Nonlinear Programming, 1st ed., Athena Scientific, Belmont, MA, 1995.
7. D. BIENSTOCK AND M. ZUCKERBERG, Subset algebra lift operators for 0-1 integer programming, SIAM J. Optim., 15 (2004), pp. 63-95.
8. B. BORCHERS, CSDP, a C library for semidefinite programming, Optim. Methods Softw., 11/12 (1999), pp. 613-623.
9. S. BURER AND R. MONTEIRO, A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization, Math. Program., 95 (2003), pp. 329-357.
10. R. E. BURKARD, S. KARISCH, AND F. RENDL, QAPLIB - a quadratic assignment problem library, J. Global Optim., 10 (1997), pp. 391-403.
11. S. CERIA AND G. PATAKI, Solving integer and disjunctive programs by lift-and-project, in Proceedings of the Sixth International IPCO Conference, Lecture Notes in Comput. Sci. 1412, R. E. Bixby, E. A. Boyd, and R. Z. Rios-Mercato, eds., 1998, pp. 271-283.
12. W. COOK AND S. DASH, On the matrix-cut rank of polyhedra, Math. Oper. Res., 26 (2001), pp. 19-30.
13. G. CORNUÉJOLS AND M. DAWANDE, A class of hard small 0-1 programs, INFORMS J. Comput., 11 (1999), pp. 205-210.
14. S. DASH, On the Matrix Cuts of Lovász and Schrijver and Their Use in Integer Programming, Ph.D. thesis, Rice University, Houston, TX, 2001.
15. See the website: http://dimacs.rutgers.edu/Challenges/.
16. W. S. DORN, Duality in quadratic programming, Quart. Appl. Math., 18 (1960/1961), pp. 155-162.
17. P. C. GILMORE, Optimal and suboptimal algorithms for the quadratic assignment problem, J. Soc. Indust. Appl. Math., 10 (1962), pp. 305-313.
18. 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.
19. R. E. GOMORY, An algorithm for integer solutions to linear programs, in Recent Advances in Mathematical Programming, R. Graves and P. Wolfe, eds., McGraw-Hill, New York, 1963, pp. 269-302.
20. P. M. HAHN, W. L. HIGHTOWER, T. A. JOHNSON, M. GUIGNARD-SPIELBERG, AND C. ROUCAIROL, A level-2 reformulation-linearization techingue bound for the quadratic assignment problem, manuscript, University of Pennsylvania, Philadelphia, PA, 2001.
21. ILOG, INC., ILOG CPLBX 8.1, User's Manual, 2002.
22. S. E. KARISCH, E. ÇELA, J. CLAUSEN, AND T. ESPERSEN, A dual framework for lower bounds of the quadratic assignment problem based on linearization, Computing, 63 (1999), pp. 351-403.
23. K. C. KIWIEL, Methods of Descent for Nondifferentiable Optimization, Springer, Berlin, 1985.
24. J. B. LASSERRE, An explicit exact SDP relaxation for nonlinear 0-1 programs, in Lecture Notes in Comput. Sci., 2081, K. Aardal and A. M. H. Gerards, eds., 2001, pp. 293-303.
25. M. LAURENT, Tighter linear and semidefinite relaxations for max-cut based on the Lovász-Schrijver lift-and-project procedure, SIAM J. Optim., 12 (2001/2002), pp. 345-375.
26. M. LAURENT, A comparison of the Sherali-Adams, Lovász-Schijver, and Lasserre relaxation for 0-1 programming, SIAM J. Optim., 28 (2003), pp. 470-496.
27. M. LAURENT AND F. RENDL, Semidefinite programming and integer programming, Technical report PNA-R0210, CWI, Amsterdam, April 2002, To appear as chapter of the Handbook on Discrete Optimization edited by K. Aardal, G. Kernhauser and R. Weismantel.
28. E. L. LAWLER, The quadratic assignment problem, Management Sci., 9 (1962/1963), pp. 586-599.
29. C. LEMARÉCHAL, Nonsmooth optimization and descent methods, Technical report, International Institute for Applied Systems Analysis, Laxenburg, Austria, 1977.
30. L. LIPTÁK AND L. TUNÇEL, The stable set problem and the lift-and-project rank of graphs, Math. Program., 98 (2003), pp. 319-353.
31. R. LOUGEE-HEIMER, The Common Optimization INterface for Operations Research, IBM Journal of Research and Development, 47 (2003), pp. 57-66; also available online from www.coin-or.org.
32. L. LOVÁSZ AND A. SCHRIJVER, Cones of matrices and set-functions, and 0-1 optimization, SIAM J. Optim., 1 (1991), pp. 166-190.
33. MIPLIB, 2003. http://miplib.zib.de/.
34. J. NOCEDAL AND S. WRIGHT, Numerical Optimization, Springer-Verlag, New York, 1999.
35. B. T. POLJAK AND N. V. TRET'JAKOV, A certain iteration method of linear programming and its economic interpretation, Èkonom. i Mat. Metody, 8 (1972), pp. 740-751.
36. QAPLIB, http://www.seas.upenn.edu/qaplib/.
37. F. RENDL AND R. SOTIROV, Bounds for the quadratic assignment problem using the bundle method, Technical report, Department of Mathematics, University of Klagenfurt, Klagenfurt, Austria, 2003.
38. 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.
39. H. D. SHERALI AND W. P. ADAMS, A Reformulation-Linearization Technique (RLT) for Solving Discrete and Continuous Nonconvex Problems, Kluwer, Dordrecht, The Netherlands, 1997.
40. H. D. SHERALI, B. ÖZDARYAL, W. P. ADAMS, AND N. ATTIA, On using exterior penalty approaches for solving linear programming problems, Comput. Oper. Res., 28 (2001), pp. 1049-1074.
41. T. STEPHEN AND L. TUNÇEL, On a representation of the matching polytope via semidefinite liftings, Math. Oper. Res., 24 (1999), pp. 1-7.