Article ID: | iaor2003764 |
Country: | Germany |
Volume: | 91 |
Issue: | 3 |
Start Page Number: | 563 |
End Page Number: | 588 |
Publication Date: | Jan 2002 |
Journal: | Mathematical Programming |
Authors: | Linderoth J.T., Anstreicher K., Brixius N., Goux J.-P. |
Keywords: | quadratic assignment |
The quadratic assignment problem (QAP) is among the hardest combinatorial optimization problems. Some instances of size