| Article ID: | iaor1993325 |
| Country: | Netherlands |
| Volume: | 53 |
| Issue: | 1 |
| Start Page Number: | 63 |
| End Page Number: | 78 |
| Publication Date: | Jan 1992 |
| Journal: | Mathematical Programming (Series A) |
| Authors: | Rendl Franz, Wolkowicz Henry |
| Keywords: | programming: parametric |
The authors investigate new bounding strategies based on different relaxations of the quadratic assignment problem. In particular, they improve the lower bound found by using an eigenvalue decomposition of the quadratic part and by solving a linear program for the linear part. The improvement is accomplished by applying a steepest ascent algorithm to the sum of the two bounds.