| Article ID: | iaor1993697 |
| Country: | United States |
| Volume: | 17 |
| Issue: | 3 |
| Start Page Number: | 726 |
| End Page Number: | 739 |
| Publication Date: | Aug 1992 |
| Journal: | Mathematics of Operations Research |
| Authors: | Rendl F., Hadley S.W., Wolkowicz H. |
| Keywords: | programming: quadratic |
New lower bounds for the quadratic assignment problem QAP are presented. These bounds are based on the orthogonal relaxation of QAP. The additional improvement is obtained by making efficient use of a tractable representation of orthogonal matrices having constant row and column sums. The new bound is easy to implement and often provides high quality bounds under an acceptable computational effort.