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 ...
This is a preview. Log in through your library . Abstract The quadratic assignment problem (QAP) is arguably one of the hardest NP-hard discrete optimization problems. Problems of dimension greater ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback