An example of the quadratic assignment problem (QAP) is the facility location problem, in which n facilities are assigned, at minimum cost, to n sites. Between each pair of facilities, there is a ...
The Quadratic Assignment Problem (QAP) is one of the most challenging NP-hard combinatorial problems and has been extensively studied over the past few decades due to its ability to model many ...
The Journal of the Operational Research Society, Vol. 47, No. 3 (Mar., 1996), pp. 457-462 (6 pages) In this paper we present a new branch and bound algorithm for solving a class of integer quadratic ...
Abstract: The Quadratic assignment problem (QAP), referring to finding an optimal assignment between two sets of interrelated objects, is a fundamental problem in combinatorial optimization. It is ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback