Abstract
We investigate new bounding strategies based on different relaxations of the quadratic assignment problem. In particular, we improve the lower bound found by using an eigenvalue decomposition of the quadratic part and by solving a linear program for the linear part. The improvement is accomplished by applying a steepest ascent algorithm to the sum of the two bounds.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R.E. Burkard and U. Derigs, “Assignment and matching problems: solution methods for Fortran-programs,” in:Lecture Notes in Economics and Mathematical Systems No. 184 (Springer, Berlin, 1980).
F.H. Clarke,Optimization and Nonsmooth Analysis (Wiley, New York, 1983).
M.E. Dyer, A.M. Frieze and C.J.H. McDiarmid, “On linear programs with random costs,”Mathematical Programming 35 (1986) 3–16.
G. Finke, R.E. Burkard and F. Rendl, “Quadratic assignment problems,”Annals of Discrete Mathematics 31 (1987) 61–82.
G. Finke and E. Medova-Dempster, “Approximation approach to combinatorial optimization problems,” Research Report, Technical University of Nova Scotia (Halifax, 1987).
P.E. Gill, W. Murray and M.H. Wright,Practical Optimization (Academic Press, San Diego, 1981).
B. Gollan, “Eigenvalue perturbations and non-linear parametric optimization,”Mathematical Programming Study 30 (1987) 67–81.
S. Hadley and H. Wolkowicz, “The Hessian of a function of the eigenvalues,” Research Report, The University of Waterloo (Waterloo, Ontario, 1988).
M. Held, P. Wolfe and P. Crowder, “Validation of subgradient optimization,”Mathematical Programming 6 (1974) 62–88.
A.J. Hoffman and H.W. Wielandt, “The variation of the spectrum of a normal matrix,”Duke Mathematical Journal 20 (1953) 37–39.
R. Horn and C. Johnson,Matrix Analysis (Cambridge University Press, Cambridge, 1985).
L. Mirsky, “The spread of a matrix,”Mathematika 3 (1956) 127–130.
K.G. MurtyLinear Programming (Wiley, New York, 1983).
C.E. Nugent, T.E. Vollman and J. Ruml, “An experimental comparison of techniques for the assignment of facilities to locations,”Operations Research 16 (1968) 150–173.
M.L. Overton, “On minimizing the maximum eigenvalue of a symmetric matrix,”SIAM Journal of Matrix Analysis and Applications 9 (1988) 256–268.
R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, NJ, 1970).
C. Roucairol, “A parallel branch and bound algorithm for the quadratic assignment problem,”Discrete Applied Mathematics 18 (1987) 211–225.
S. Sahni and T. Gonzales, “P-complete approximation problems,”Journal of the Association for Computing Machinery 23 (1976) 555–565.
H. Schramm and J. Zowe, “A combination of the bundle approach and the trust region concept,” in: J. Guddat et al., eds.,Advances in Mathematical Optimization (Akademie Verlag, Berlin, 1988).
H. Wolkowicz and G.P.H. Styan, “Bounds for eigenvalues using traces,”Linear Algebra and its Applications 29 (1980) 471–506.
J. Zowe, “The BT-algorithm for minimizing a nonsmooth functional subject to linear constraints,” Working paper 1088, University of Bergen (Bergen, 1988).
Author information
Authors and Affiliations
Additional information
Both authors would like to thank the Natural Sciences and Engineering Research Council Canada and the Austrian Government for their support.
This author would like to acknowledge partial support from the Department of Combinatorics and Optimization at the University of Waterloo.
Research partially supported by Natural Sciences and Engineering Research Council Canada.
Rights and permissions
About this article
Cite this article
Rendl, F., Wolkowicz, H. Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem. Mathematical Programming 53, 63–78 (1992). https://doi.org/10.1007/BF01585694
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01585694