Highly Influenced

# Local Search and Metaheuristics for the Quadratic Assignment Problem

@inproceedings{SttzleLocalSA, title={Local Search and Metaheuristics for the Quadratic Assignment Problem}, author={Thomas St{\"u}tzle} }

The quadratic assignment problem (QAP) is an important problem in theory and practice. It was , which was introduced by Koopmans and Beckmann in 1957 [28] and is a model for many practical problems like backboard wiring [53], campus and hospital layout [15, 17], typewriter keyboard design [9], scheduling [23] and many others [16, 29] can be formulated as QAPs. Intuitively, the QAP can best be described as the problem of assigning a set of facilities to a set of locations with given distances… CONTINUE READING