The Quadratic Assignment Problem (1998)
| Venue: | HANDBOOK OF COMBINATORIAL OPTIMIZATION, P. PARDALOS AND D.-Z. DU, EDS. |
| Citations: | 70 - 3 self |
BibTeX
@MISC{Burkard98thequadratic,
author = {Rainer E. Burkard and Eranda Çela and Panos M. Pardalos and Leonidas S. Pitsoulis},
title = {The Quadratic Assignment Problem},
year = {1998}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper aims at describing the state of the art on quadratic assignment problems (QAPs). It discusses the most important developments in all aspects of the QAP such as linearizations, QAP polyhedra, algorithms to solve the problem to optimality, heuristics, polynomially solvable special cases, and asymptotic behavior. Moreover, it also considers problems related to the QAP, e.g. the biquadratic assignment problem, and discusses the relationship between the QAP and other well known combinatorial optimization problems, e.g. the traveling salesman problem, the graph partitioning problem, etc. The paper will appear in the Handbook of Combinatorial Optimization to be published by Kluwer Academic Publishers, P. Pardalos and D.-Z. Du, eds.
