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

Citations

Publications citing this paper.
Showing 1-10 of 26 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 63 references

Models for Iterative Global Optimization

  • K. D. Boese
  • PhD thesis, University of California, Computer…
  • 1996
Highly Influential
7 Excerpts

An improved annealing scheme for the QAP

  • D. T. Connolly
  • European Journal of Operational Research, 46:93…
  • 1990
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…