A new relaxation framework for quadratic assignment problems based on matrix splitting

Mathematical Programming Computation

Volumn 2, Issue 1, 2010, Pages 59-77

  Peng, Jiming ^a   Mittelmann, Hans ^b   Li, Xiaoxue ^a  

^a University of Illinois at Urbana Champaign   (United States)

^b ARIZONA STATE UNIVERSITY   (United States)

Author keywords

Lower bound; Matrix splitting; Quadratic assignment problem (QAP); Relaxation; Semidefinite programming (SDP)

Indexed keywords

LOWER BOUNDS; MATRIX SPLITTINGS; QUADRATIC ASSIGNMENT PROBLEMS; RELAXATION; SEMI-DEFINITE PROGRAMMING;

RELAXATION PROCESSES;

MATHEMATICAL PROGRAMMING;

EID: 84870442025     PISSN: 18672949     EISSN: 18672957     Source Type: Journal    
DOI: 10.1007/s12532-010-0012-6     Document Type: Article

References (30)

1. Adams, W.P., Johnson, T.A.: Improved linear programming-based lower bounds for the quadratic assignment problem. In: Pardalos, P.M., Wolkowicz, H. (eds.) Quadratic Assignment and Related Problems, DIMACS 25 Series in Discrete Mathematics and Theoretical Computer Science, pp. 43-75 (1994)
2. Adams, W.P., Sherali, H.D.: A tight linearization and an algorithm for zero-one quadrtic programming problems. Manage. Sci. 32, 1274-1290 (1986)
3. Anstreicher, K.M., Brixius, N.W.: A new bound for the quadratic assignment problem based on convex quadratic programming. Math. Program. 80, 341-357 (2001)
4. Anstreicher, K.M., Brixius, N.W., Goux, J.-P., Linderoth, J.: Solving large quadratic assignment problems on computational grids. Math. Program. 91, 563-588 (2002)
5. Ben-David, G., Malah, D.: Bounds on the performance of vector-quantizers under channel errors. IEEE Trans. Inf. Theory 51(6), 2227-2235 (2005)
6. Burer, S., Vandenbussche, D.: Solving lift-and-project relaxations of binary integer programs. SIAM J. Optim. 16, 726-750 (2006)
7. Burkard, R.E., Ela, E., Karisch, S.E., Rendl, F.: QAPLIB-A quadratic assignment problem library. J. Glob. Optim. 10, 391-403 (1997)
8. Ding, Y., Wolkowicz, H.:Amatrix-lifting semidefinite relaxation for the quadratic assignment problem. Technical report CORR 06-22, University of Waterloo, Ontario, Canada, October (2006)
9. Fiedler, M.: Algebraic connectivity of graphs. Czechoslovak Math. J. 23(98) (1973)
10. Fiedler, M.: Laplacian of graphs and algebraic connectivity. Comb. Graph Theory 25, 57-70 (1989)
11. Gilmore, P.C.: Optimal and suboptimal algorithms for the quadratic assignment problem. SIAM J. Appl. Math. 10, 305-313 (1962)
12. Golub, G., Loan, C.V.: Matix Computation. John Hopkins University Press, Baltimore (1996)
13. Hadley, S.W., Rendl, F., Wolkowicz, H.:Anewlower bound via projection for the quadratic assignment problem. Math. Oper. Res. 17, 727-739 (1992)
14. Hahn, P., Grant, T.: Lower bounds for the quadratic assignment problem based upon a dual formulation. Oper. Res. 46, 912-922 (1998)
15. Hannan, M., Kurtzberg, J.M.: Placement techniques. In: Breuer, M.A. (ed.) Design Automation of Digital Systems: Theory and Techniques, vol. 1, pp. 213-282. Prentice-hall, Englewood Cliffs (1972)
16. Jansson, C., Keil, C.: Rigorous error bounds for the optimal value in semidefinite programming. SIAM J. Numer. Anal. 46, 188-200 (2007)
17. de Klerk, E., Sotirov, R.: Exploring group summetry in semidefinite programming relaxations of the quadratic assignment problem. Math. Program. 122(2), 225-246 (2010)
18. Koopmans, T., Beckmann, M.: Assignment problems and the location of economic activities. Econometrica 25, 53-76 (1957)
19. Lawler, E.: The quadratic assignment problem. Manage. Sci. 9, 586-599 (1963)
20. Loiola, E.M., Maiade Abreu, N.M., Boaventura-Netto, P.O., Hahn, P., Querido, T.: A survey for the quadratic assignment problem. Eur. J. Oper. Res. 176(2), 657-690 (2007)
21. Macdonald, I.G.: Symmetric Functions andHall Polynomials. The Clarendon Press, Oxford University Press, New York (1995)
22. Mittelmann, H., Peng, J., Wu, X.: Graph modeling for quadratic assignment problem associated with the hypercube. Technical Report. University of Illinois at Urbana-Champaign. http://www. optimization-online.org/DB_HTML/2007/06/1674.html (2007)
23. Mittelmann, H., Peng, J.: Estimating bounds for quadratic assignment problems associated with hamming and manhattan distance matrices based on semidefinite programming. Technical Report. University of Illinois atUrbana-Champaign. http://www.optimization-online.org/DB_HTML/2008/05/1980. html (2008)
24. Nugent, C.E., Vollman, T.E., Ruml, J.: An experimental comparison of techniques for the assignment of facilities to locations. Oper. Res. 16, 150-173 (1968)
25. Potter, L.C., Chiang, D.M.: Minimax nonredundant channel coding. IEEE Trans. Commun. 43(2/3/4), 804-811 (1995)
26. Rendl, F., Sotirov, R.: Bounds for the quadrtic assignment problem using bundle method. Math. Program. Series B 109(2-3), 505-524 (2007)
27. Rendl, F., Wolkowicz, H.: Applications of pasrametric programming and eigenvalue maximization to the quadratic assignment problem. Math. Program. Series A 53(1), 63-78 (1992)
28. Taillard, E.D.: Comparison of iterative searches for the quadratic assingnment problem. Location Sci. 3, 87-105 (1995)
29. Toh, K.C.: Private communication (2009)
30. Zhao, Q., Karisch, S.E., Rendl, F., Wolkowicz, H.: Semidefinite programming relaxations for the quadratic assignment problem. J. Comb. Optim. 2, 71-109 (1998)