| Article ID: | iaor19921944 |
| Country: | United States |
| Volume: | 40 |
| Start Page Number: | 855 |
| End Page Number: | 868 |
| Publication Date: | Jan 1992 |
| Journal: | Operations Research |
| Authors: | Carraresi Paolo, Malucelli Federico |
| Keywords: | location, heuristics |
The authors introduce a new lower bound for the quadratic assignment problem based on a sequence of equivalent formulations of the problem. They present a procedure for obtaining tight bounds by sequentially applying the present approach in conjunction with the A. Assad and W. Xu bound and the N. Christofides and M. Gerrard bound.