Bounds for the quadratic assignment problem using the bundle method

Mathematical Programming

Volumn 109, Issue 2-3, 2007, Pages 505-524

  Rendl, Franz ^a   Sotirov, Renata ^b  

^a UNIVERSITY OF KLAGENFURT   (Austria)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Bundle method; Interior point method; Quadratic assignment problem; Semidefinite programming relaxation

Indexed keywords

APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTATIONAL METHODS; PROBLEM SOLVING;

BUNDLE METHOD; INTERIOR POINT METHOD; QUADRATIC ASSIGNMENT PROBLEMS; SEMIDEFINITE PROGRAMMING RELAXATION;

QUADRATIC PROGRAMMING;

EID: 33846692579     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-006-0038-8     Document Type: Article

References (32)

1. Adams, W.P., Johnson, T.A.: Improved linear programming-based lower bounds for the quadratic assignment problem. In: Proceedings of the DIMACS Workshop on Quadratic Assignment Problems, DIMACS Series in Discrete Mathematics and Theoretical Computes Sciences, vol.16, pp. 43-75. American Mathematical Society (1994)
2. Anstreicher, K.: Recent advances in the solution of quadratic assignment problems. Mathe. Program. B 97, 27-42 (2003)
3. Anstreicher, K., Brixius, N.: A new bound for the quadratic assignment problem based on convex quadratic programming. Mathe. Program. 89, 341-357 (2001)
4. Anstreicher, K., Brixius, N., Goux, J.-P., Linderoth, J.: Solving large quadratic assignment problems on computational grids. Mathe. Program. B 91, 563-588 (2002)
5. Burer, S., Monteiro, R.D.C.: Local minima and convergence in low-rank semidefinite programming. Mathe. Program. 103, 427-444 (2005)
6. Burer, S., Vandenbussche, D.: Solving lift-and-project relaxations of binary integer programs. SIAM J. Optim. 16(3), 726-750 (2006)
7. Burkard, R.E., Karisch, S., Rendl, F.: QAPLIB - A quadratic assignment problem library. J. Global Optim. 10, 391-403 (1997)
8. Burkard, R., Cela, E., Pardalos, P.M., Pitsoulis, L.: The quadratic assignment problem. In: Du, D.-Z., Pardalos, P.M., (eds.) Handbook of Combinatorial Optimization. Kluwer Dordrechet vol. 3, pp. 241-337 (1999)
9. Cela, F.: The quadratic assignment problem: Theory and Algorithms. Kluwer, Massachessets (1998)
10. Clausen, J., Perregaard., M.: Solving large quadratic assignment problems in parallel. Computa. Optimi. Appl. 8, 111-127 (1997)
11. Finke, G., Burkard, R.E., Rendl, F.: Quadratic assignment problems. Ann. Discrete Mathe. 31, 61-82 (1987)
12. Fischer, I., Gruber, G., Rendl, F., Sotirov, R.: Computational experience with a bundle approach for semidefinite cutting plane relaxations of max-cut and equipartition. Mathe. Program. B, 105, 451-469, (2006)
13. Foster, I., Kesselman, C.: Computational grids. In: Foster, I., Kesselman, C.: (eds.) The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (1999)
14. Graham, A.: Kronecker Products and Matrix Calculus with Applications. Mathematics and its Applications. Ellis Horwood Limited, Chichester (1981)
15. Hadley, S.W., Rendl, F., Wolkowicz, H.: A new lower bound via projection for the quadratic assignment problem. Mathe. Oper. Res. 17, 727-739 (1992)
16. Hahn, P.M., Grant, T., Hall, N.: A branch-and-bound algorithm for the quadratic assignment problem based on the hungarian method. Eur. I Oper. Res. 108, 629-640 (1998)
17. Hahn, P.M., Hightower, W.L., Johnson, T.A., Guignard-Spielberg, M., Roucairol, C.: Tree elaboration strategies in branch and bound algorithms for solving the quadratic assignment problem. Yugosl. J. Oper. Res. 11, 41-60 (2001)
18. Helmberg, C.: A cutting plane algorithm for large scale semidefinite relaxations. In: Grötschel, M. (ed.) Padberg Festschrift: The Sharpest Cut, MPS-SIAM, pp. 233-256 (2004)
19. Helmberg, C., Rendl, F.: A spectral bundle method for semidefinite programming. SIAM J. Optim. 10(3), 673-69 (2000)
20. Hiriart-Urruty, J. B., Lemaréchal, C.: Convex Analysis and Minimization Algorithms II. Springer, Berlin Heidelberg New York (1991)
21. Karisch, S.E.: Nonlinear Approaches for Quadratic Assignment and Graph Partition Problems. Dissertation, Technical University of Graz, Austria (1995)
22. Karisch, S. E., Çela, E., Clausen, J., Espersen, T.: A dual framework for lower bounds of the quadratic assignment problem based on linearization. Computing 63, 351-403 (1999)
23. Pardalos, P.M., Pitsoulis, L. (eds.): Nonlinear Assignment Problems: Algorithms and Applications. Kluwer, Dordrecht (2000)
24. Pardalos, P.M., Wolkowicz, H. (eds.): Quadratic Assignment and Related Problems. American Mathematical Society, Providence, RI, (1994). Papers from the workshop held at Rutgers University, New Brunswick, New Jersey, May 20-21 (1993)
25. Rendl, F.: The quadratic assignment problem. In: Drezner, Z., Hamacher, H.W. (eds.) Facility Location: Applications and Theory, Springer, pp. 439-457, Berlin Heidelberg New York (2002)
26. Rendl, F., Wolkowicz, H.: Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem. Mathe. Program, 53, 63-78 (1992)
27. Resende, M.G.C., Ramakrishnan, K.G., Drezner, Z.: Computing lower bounds for the quadratic assignment problem with an interior point algorithm for linear programming. Oper. Res. 43(5), 63-78 (1992)
28. Sahni, S., Gonzales, T.: P-complete approximation problems. J. ACM 23, 555-565 (1976)
29. Schramm, H., Zowe, J.: A version of the bundle idea for minimizing a nonsmooth function: conceptional idea, convergence analysis, numerical results. SIAM J. Optim. 2, 121-152 (1992)
30. Sotirov, R.: Bundle Methods in Combinatorial Optimization. Dissertation, University of Klagenfurt, Austria (2003)
31. Zhao, Q., Karisch, S.E., Rendl, F., Wolkowicz, H.: Semidefinite programming relaxations for the quadratic assignment problem. J. Combi. Optim. 2, 71-109 (1998)
32. Zowe, J.: Nondifferentiable optimization - a motivation and a short introduction into the subgradient - and the bundle concept. In: Schittkowski, K. (eds.) NATO ASI Series, vol. 15, Computational Mathematical Programming. Springer, Berlin Heidelberg New York (1985)