Abstract
Semidefinite programming (SDP) relaxations for the quadratic assignment problem (QAP) are derived using the dual of the (homogenized) Lagrangian dual of appropriate equivalent representations of QAP. These relaxations result in the interesting, special, case where only the dual problem of the SDP relaxation has strict interior, i.e., the Slater constraint qualification always fails for the primal problem. Although there is no duality gap in theory, this indicates that the relaxation cannot be solved in a numerically stable way. By exploring the geometrical structure of the relaxation, we are able to find projected SDP relaxations. These new relaxations, and their duals, satisfy the Slater constraint qualification, and so can be solved numerically using primal-dual interior-point methods.
For one of our models, a preconditioned conjugate gradient method is used for solving the large linear systems which arise when finding the Newton direction. The preconditioner is found by exploiting the special structure of the relaxation. See e.g., Vandenverghe and Boyd (1995) for a similar approach for solving SDP problems arising from control applications.
Numerical results are presented which indicate that the described methods yield at least competitive lower bounds.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
W.P. Adams and T.A. Johnson, “Improved linear programming-based lower bounds for the quadratic assignment problem,” in Proceedings of the DIMACS Workshop on Quadratic Assignment Problems, volume 16 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, 1994, pp. 43-75.
F. Alizadeh, J-P.A. Haeberly, and M.L. Overton, “A new primal-dual interior-point method for semidefinite programming,” Technical report, Courant Institute of Mathematical Sciences, 1994, in Proceedings of the Fifth SIAM Conference on Applied Linear Algebra, J.G. Lewis (Ed.), SIMA, Snowbird, Utah, June 1994, pp. 113-117.
G.P. Barker and D. Carlson, “Cones of diagonally dominant matrices,” Pacific J. of Math., vol. 57, pp. 15-32, 1975.
S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan, Linear Matrix Inequalities in System and Control Theory, volume 15 of Studies in Applied Mathematics, SIAM: Philadelphia, PA, June 1994.
R.E. Burkard, “Locations with spatial interactions: The quadratic assignment problem,” in Discrete Location Theory, P.B. Mirchandani and R.L. Francis (Eds.), John Wiley, 1991.
R.E. Burkard, S. Karisch, and F. Rendl, “Aquadratic assignment problem library,” European Journal of Operations Research, vol. 55, pp. 151-119, 1991. http://fmatbhp1.tu-graz.ac.at/ karisch/rep287.ps for updates.
R.E. Burkard and E. Çela, “Quadratic and three-dimensional assignment problems,” Technical report SFB report 63, Institute of Mathematics, University of Technology Graz, 1996.
T.J. Carpenter, I.J. Lustig, R.E. Marsten, and D.F. Shanno, “Higher-order predictor-corrector interior point methods with application to quadratic objectives,” SIAM Journal on Optimization, vol. 3, no.4, pp. 696-725, 1993.
J. Clausen, A. Bruengger, M. Perregard, and A. Marzatta, “Joining forces in problem solving: Combining problem-specific knowledge and high-performance hardware by a parallel search library to solve large-scale quadratic assignment problems,” Technical report, University of Copenhagen, 1996a.
J. Clausen, S.E. Karisch, M. Perregard, and F. Rendl, “On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel,” Technical report, Institute of Mathematics, University of Technology Graz, 1996b.
R.J. Duffin, “Infinite programs,” in Linear Equalities and Related Systems, A.W. Tucker (Ed.), Princeton University Press: Princeton, NJ, 1956, pp. 157-170.
G. Finke, R.E. Burkard, and F. Rendl, “Quadratic assignment problems,” Annals of Discrete Mathematics, vol. 31, pp. 61-82, 1987.
P.C. Gilmore, “Optimal and suboptimal algorithms for the quadratic assignment problem,” SIAM Journal on Applied Mathematics, vol. 10, pp. 305-313, 1962.
M.X. Goemans and D.P. Williamson, “.878-Approximation algorithms for MAX CUT and MAX 2SAT,” in ACM Symposium on Theory of Computing (STOC), 1994.
M.X. Goemans and D.P. Williamson, “Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming,” Journal of Association for Computing Machinery, vol. 42, no.6, pp. 1115-1145, 1995.
S.W. Hadley, F. Rendl, and H. Wolkowicz, “A new lower bound via projection for the quadratic assignment problem,” Mathematics of Operations Research, vol. 17, pp. 727-739, 1992.
C. Helmberg, “An interior point method for semidefinite programming and max-cut bounds,” Ph.D. thesis, Graz University of Technology, Austria, 1994.
C. Helmberg, S. Poljak, F. Rendl, and H. Wolkowicz, “Combining semidefinite and polyhedral relaxations to integer programs,” in Proceedings of the 4th International IPCO Conference, volume 920 of Lecture Notes in Computer Science, Springer, 1995, pp. 124-134.
C. Helmberg, F. Rendl, R.J. Vanderbei, and H. Wolkowicz, “An interior point method for semidefinite programming,” SIAM Journal on Optimization, pp. 342-361, 1996. URL: ftp://orion.uwaterloo.ca/pub/ henry/reports/sdp.ps.gz.
R. Horn and C. Johnson, Matrix Analysis. Cambridge University Press: New York, 1985.
M. Jünger and V. Kaibel, “A basic study of the qap-polytope,” Technical report Technical report No. 96.215, Institut für Informatik, Universität zu Köln, Germany, 1995.
S.E. Karisch, “Nonlinear Approaches for Quadratic Assignment and Graph Partition Problems,” Ph.D. thesis, University of Graz, Graz, Austria, 1995.
S.E. Karisch and F. Rendl, “Lower bounds for the quadratic assignment problem via triangle decompositions,” Mathematical Programming, vol. 71, no.2, pp. 137-152, 1995.
M. Kojima, S. Shindoh, and S. Hara, “Interior-point methods for the monotone linear complementarity problem in symmetric matrices,” Technical report, Dept. of Information Sciences, Tokyo Institute of Technology, Tokyo, Japan, 1994.
S. Kruk and H. Wolkowicz, “SQ2P, sequential quadratic constrained quadratic programming,” to appear in Proceedings of Nonlinear Programming Conference in Beijing in honour of Professor M.J.D. Powell.
E. Lawler, “The quadratic assignment problem,” Management Science, vol. 9, pp. 586-599, 1963.
L. Lovász and A. Schrijver, “Cones of matrices and set-functions and 0-1 optimization,” SIAM Journal on Optimization, vol. 1, no.2, pp. 166-190, 1991.
I.J. Lustig, R.E. Marsten, and D.F. Shanno, “On implementing Mehrotra's predictor-Corrector interior point method for linear programming,” SIAM Journal on Optimization, vol. 2, no.3, pp. 435-449, 1992.
C.E. Nugent, T.E. Vollman, and J. Ruml, “An experimental comparison of techniques for the assignment of facilities to locations,” Operations Research, vol. 16, pp. 150-173, 1968.
P. Pardalos, F. Rendl, and H. Wolkowicz, “The quadratic assignment problem: Asurvey and recent developments,” in Proceedings of the DIMACS Workshop on Quadratic Assignment Problems, volume 16 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, 1994, pp. 1-41.
G. Pataki, “Algorithms for cone-optimization problems and semi-definite programming,” Technical report, GSIA Carnegie Mellon University, Pittsburgh, PA, 1993.
S. Poljak, F. Rendl, and H. Wolkowicz, “A recipe for semidefinite relaxation for (0, 1)-quadratic programming,” Journal of Global Optimization, vol. 7, pp. 51-73, 1995.
L. Portugal, M.G.C. Resende, G. Veiga, and J. Judice, “A truncated primal-infeasible dual-fesible network interior point method,” Technical report, Universidade de Coimbra, Coimbra, Portugal, 1994.
K.G. Ramakrishnan, M.G.C. Resende, and P.M. Pardalos, “A branch and bound algorithm for the quadratic assignment problem using a lower bound based on linear programming,” in State of the Art in Global Optimization: Computational Methods and Applications, C. Floudas and P.M. Pardalos (Eds.), Kluwer Academic Publishers, 1995.
M. Ramana, L. Tuncel, and H. Wolkowicz, “Strong duality for semidefinite programming,” SIAM Journal on Optimization, to appear, 1997. URL: ftp://orion.uwaterloo.ca/pub/henry/reports/strongdual.ps.gz.
F. Rendl and H. Wolkowicz, “Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem,” Mathematical Programming, vol. 53, pp. 63-78, 1992.
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, vol. 43, no.5, pp. 781-791, 1995.
M. Rijal, “Scheduling, design and assignment problems with quadratic costs,” Ph.D. thesis, New York University, New York, USA, 1995.
S. Sahni and T. Gonzales, “P-complete approximation problems,” Journal of ACM, vol. 23, pp. 555-565, 1976.
H.D. Sherali and W.P. Adams, “Computational advances using the reformulation-linearlization technique (rlt) to solve discrete and continuous nonconvex problems,” Optima, vol. 49, pp. 1-6, 1996.
L. Vandenberghe and S. Boyd, “Primal-dual potential reduction method for problems involving matrix inequalities,” Math. Programming, vol. 69, no.1, pp. 205-236, 1995.
L. Vandenberghe and S. Boyd, “Semidefinite programming,” SIAM Review, vol. 38, pp. 49-95, 1996.
H. Wolkowicz, “Some applications of optimization in matrix theory,” Linear Algebra and its Applications vol. 40, pp. 101-118, 1981.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zhao, Q., Karisch, S.E., Rendl, F. et al. Semidefinite Programming Relaxations for the Quadratic Assignment Problem. Journal of Combinatorial Optimization 2, 71–109 (1998). https://doi.org/10.1023/A:1009795911987
Issue Date:
DOI: https://doi.org/10.1023/A:1009795911987