×

Locations with spatial interactions: The quadratic assignment problem. (English) Zbl 0726.90041

Discrete location theory, 387-437 (1990).
[For the entire collection see Zbl 0718.00021]
This chapter is an excellent overview of the theory and algorithms for the quadratic assignment problem (QAP). It contains the following sections: 9.1. Introduction and examples; 9.2. Integer programming formulations of QAPs; 9.3. Special cases and computational complexity; 9.4. Bounds for QAP; 9.5. Exact algorithms for solving QAPs; 9.6. Heuristics for QAPs, 9.6.1. Limited enumeration methods, 9.6.2. Construction methods, 9.6.3. Improvement methods; 9.6.4. Simulation approaches; 9.7. Some available computer codes and computational experiences; 9.8. The asymptotic behavior of QAPs. Exercises and an extensive reference list conclude the chapter.

MSC:

90B80 Discrete location and assignment
90-02 Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
90C10 Integer programming
90C20 Quadratic programming
90C27 Combinatorial optimization
90C60 Abstract computational complexity for mathematical programming problems

Citations:

Zbl 0718.00021