A cutting planes algorithm based upon a semidefinite relaxation for the Quadratic Assignment Problem

Lecture Notes in Computer Science

Volumn 3669, Issue , 2005, Pages 850-861

  Faye, Alain ^a   Roupin, Frédéric ^a  

^a Bioinformatique et Chimie Moléculaire   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; CONVERGENCE OF NUMERICAL METHODS; PROBLEM SOLVING; QUADRATIC PROGRAMMING;

CUTTING PLANES ALGORITHMS; QUADRATIC ASSIGNMENT PROBLEMS; SEMIDEFINITE RELAXATION;

ALGORITHMS;

EID: 27144520265     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_75     Document Type: Conference Paper

References (20)

1. K. Anstreicher and N. Brixius. A New Bound for the Quadratic Assignment Problem Based on Convex Quadratic Programming. Math. Prog. 89:341-357, 2001.
2. A. Billionnet and S. Elloumi. Best reduction of the quadratic semi-assignment problem. Discrete Applied Mathematics 109(3): 197-213, 2001.
3. A. Blanchard, S. Elloumi, A. Faye and N. Wicker. Un algorithme de génération de coupes pour le problème de l'affectation quadratique. INFOR 41(1):35-49, 2003.
4. R.E. Burkard, S.E. Karisch and F. Rendl, QAPLIB. A Quadratic Assignment Problem Library, J. of Global Opt. 10:391-403, 1997.
5. F.Çela. The Quadratic Assignment Problem: Theory and Algorithms. Kluwer, Massachessets, USA, 1998.
6. A. Faye and F. Roupin. Partial Lagrangian and Semidefinite Relaxations of Quadratic Problems. In proceedings ROADEF'2005, Tours, 14-16 february 2005. Research report RC673, available at http://cedric.cnam.fr.
7. C. Helmberg and F. Rendl. Solving quadratic (0,1)-problems by semidefinite programs and cutting planes. Math. Progr. 82(3,A):291-315, 1998.
8. C. Helmberg. Semidefinite Programming for Combinatorial Optimization. Habilitationsschrift, TU Berlin, ZIB-report ZR-00-34, KZZI, Takustraße 7, 14195 Berlin, Germany, 2000.
9. C. Helmberg and F. Rendl. A spectral bundle method for semidefinite programming. SIAM J. Optim. 10(3):673-696, 2000.
10. C. Hemberg. A C++ implementation of the Spectral Bundle Method. http://www-user.tu-chemnitz.de/~helmberg/SBmethod/.
11. C. Helmberg. Cutting planes algorithm for large scale semidefinite relaxations. ZIB-Report ZR 01-26, KZZI, Takustraße 7, 14195 Berlin, Germany, 2001.
12. G. Delaporte, S. Jouteau and F. Roupin. SDP_S: a Tool to formulate and solve Semidefinite relaxations for Bivalent Quadratic problems. In Proceedings ROADEF 2003, Avignon 26-28 F́vrier, 2003.http://semidef.free.fr.
13. S.E. Karisch. Nonlinear approaches for the quadratic assignment and graph partition problems. PhD thesis, Graz University of Technology, Graz, Austria, 1995.
14. C. Lemarechal and F. Oustry. Semidefinite relaxations and Lagrangian duality with application to combinatorial optimization. RR-3710, INRIA Rhone-Alpes, 1999.
15. Hans D. Mittelmann. An Independent Benchmarking of SDP and SOCP Solvers. Math. Progr. 95(2).-407-430, 2003.
16. S. Poljak, F. Rendl and H. Wolkowicz. A recipe for semidefinite relaxation for (0,1)-quadratic programming. J. of Global Opt. 7:51-73, 1995.
17. F. Rendl and R. Sotirov. Bounds for the Quadratic Assignment Problem Using the Bundle Method. Research Report, University Of Klagenfurt, Universitaetsstrasse 65-67, Austria, 2003. Available at Optimization-online.org.
18. M.G.C Resende, K.G. Ramakrishnan, and Z. Drezner. Computing lower bounds for the quadratic assignment problem with an interior point algorithm for linear programming. Operations Research 43(5):781-791, 1995.
19. F. Roupin. From Linear to Semidefinite Programming: an Algorithm to obtain Semidefinite Relaxations for Bivalent Quadratic Problems. J. of Comb. Opt. 8(4):469-493, 2004.
20. Q. Zhao, S.E. Karisch, F. Rendl and H. Wolkowicz. Semidefinite programming relaxations for the quadratic assignment problem. J. of Comb. Opt. 2(1):71-109, 1998.