| Article ID: | iaor1998959 |
| Country: | Netherlands |
| Volume: | 77 |
| Issue: | 1 |
| Start Page Number: | 126 |
| End Page Number: | 140 |
| Publication Date: | Aug 1994 |
| Journal: | European Journal of Operational Research |
| Authors: | White D.J. |
| Keywords: | programming: assignment, heuristics |
Finding bounds for the quadratic assignment problem is important as part of some procedures for solving this problem. In this paper a commonly used bound, due to Gilmore, is extended to a set of possible bounds. Analytic properties of the functions underlying these bounds are given, and computational approaches are suggested which make use of these properties.