3-Quadratic assignment problem (QAP)
The QAP is a combinatorial optimization problem stated for the first time by Koopmans and Beckman in 1957[7]. The quadratic assignment problem (QAP) is the problem consists in assigning n facilities to n locations with the objective of minimizing the cost of the assignment, where the cost is defined by a quadratic function