Abstract
Consider the following situation: n buildings are to be erected on n possible sites. It is known, how often people have to go from building j to building q per day. The buildings shall be erected such that the total walking distance of the people becomes minimal. This problem, which arises in many situations, is known as quadratic assignment problem (QAP). A short mathematical description can be given as follows.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Burkard, R.E., Derigs, U. (1980). Quadratic Assignment Problems. In: Assignment and Matching Problems: Solution Methods with FORTRAN-Programs. Lecture Notes in Economics and Mathematical Systems, vol 184. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-51576-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-51576-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10267-0
Online ISBN: 978-3-642-51576-7
eBook Packages: Springer Book Archive