DMCA
A Branch and Bound Algorithm for the Quadratic Assignment Problem using a Lower Bound Based on Linear Programming (1995)
| Venue: | In C. Floudas and P.M. Pardalos, editors, State of the Art in Global Optimization: Computational Methods and Applications |
| Citations: | 10 - 2 self |
BibTeX
@INPROCEEDINGS{Ramakrishnan95abranch,
author = {K. G. Ramakrishnan and M. G. C. Resende and P.M. Pardalos},
title = {A Branch and Bound Algorithm for the Quadratic Assignment Problem using a Lower Bound Based on Linear Programming},
booktitle = {In C. Floudas and P.M. Pardalos, editors, State of the Art in Global Optimization: Computational Methods and Applications},
year = {1995},
pages = {57--73},
publisher = {Kluwer Academic Publishers}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this paper, we study a branch and bound algorithm for the quadratic assignment problem (QAP) that uses a lower bound based on the linear programming (LP) relaxation of a classical integer programming formulation of the QAP. Computational experience with the branch and bound algorithm on several QAP test problems is reported. The linear programming relaxations are solved with an implementation of an interior point algorithm that uses a preconditioned conjugate gradient algorithm to compute directions. The branch and bound algorithm is compared with a similar branch and bound algorithm that uses the Gilmore-Lawler lower bound (GLB) instead of the LP-based bound. The LP-based algorithm examines a small portion of the nodes explored by the GLB-based algorithm. 1 Introduction The quadratic assignment problem (QAP), first proposed by Koopmans and Beckmann [16], can be stated as min p2\Pi n X i=1 n X j=1 a ij b p(i)p(j) ; To appear in Proceedings of State of the Art in Global Opti...
