| Article ID: | iaor1995761 |
| Country: | Switzerland |
| Volume: | 50 |
| Issue: | 1 |
| Start Page Number: | 387 |
| End Page Number: | 410 |
| Publication Date: | Sep 1994 |
| Journal: | Annals of Operations Research |
| Authors: | Pardalos P.M., Ramakrishnan K.G., Li Y., Resende M.G.C. |
| Keywords: | quadratic assignment |
The authors investigate the classical Gilmore-Lawler lower bound for the quadratic assignment problem. They 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.