We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Lower bounds for the quadratic assignment problem.
- Authors
Li, Y.; Pardalos, P. M.; Ramakrishnan, K. G.; Resende, M. G. C.
- Abstract
We investigate the classical Gilmore–Lawler lower bound for the quadratic assignment problem. We provide evidence of the difficulty of improving the Gilmore–Lawler bound and develop new bounds by means of optimal reduction schemes. Computational results are reported indicating that the new lower bounds have advantages over previous bounds and can be used in a branch-and-bound type algorithm for the quadratic assignment problem.
- Subjects
QUADRATIC assignment problem; MATRICES (Mathematics); EIGENVALUES; ALGORITHMS; MATHEMATICAL programming
- Publication
Annals of Operations Research, 1994, Vol 50, Issue 1-4, p387
- ISSN
0254-5330
- Publication type
Article
- DOI
10.1007/BF02085649