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 paper compares the computational performance of the quadratic programming algorithms of Dantzig, Beale, Wolfe and a modification of Wolfe's algorithm. Problems are generated and solved on the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback