book chapter · Contributions to management science · 2009
Quadratic Assignment Problem
Masoumeh Bayat, Mahdieh Sedghi
Cited by 7Abstract and details only
Abstract
The quadratic assignment problem (QAP) in location Theory is the problem of locating facilities the cost of placing a facility depends on the distances from other facilities and also the interaction with other facilities. QAP was introduced by Koopmans and Beckman in 1957 who were trying to model a facilities location problem. It is possible to formulate some classic problems of combinatorial optimization, such as the traveling salesman, maximum clique and graph partitioning problems as a QAP. The QAP belongs to the class of NP-complete problems and is considered one of the most difficult combinatorial optimization problems. Exact solution strategies for the QAP have been unsuccessful for large problem (approximately N ≤ 25).
Cite this paper
Bayat, M., & Sedghi, M. (2009). Quadratic Assignment Problem. Contributions to management science, 111–143. https://doi.org/10.1007/978-3-7908-2151-2_6
Bayat, Masoumeh, and Mahdieh Sedghi. “Quadratic Assignment Problem.” Contributions to management science, 2009, pp. 111–43, https://doi.org/10.1007/978-3-7908-2151-2_6.
Bayat, Masoumeh, and Mahdieh Sedghi. 2009. “Quadratic Assignment Problem.” Contributions to management science: 111–43. https://doi.org/10.1007/978-3-7908-2151-2_6.
Bayat, M. and Sedghi, M. (2009) ‘Quadratic Assignment Problem’, Contributions to management science, pp. 111–143. Available at: https://doi.org/10.1007/978-3-7908-2151-2_6.
@incollection{bayat2009quadratic,
title = {{Quadratic Assignment Problem}},
author = {Bayat, Masoumeh and Sedghi, Mahdieh},
booktitle = {Contributions to management science},
pages = {111--143},
year = {2009},
doi = {10.1007/978-3-7908-2151-2_6}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.