News
Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation Peter Hahn and Thomas Grant Operations Research , pp. 912-922 (11 pages) ...
This problem is NP-complete and is also a generalization of the Traveling Salesman Problem. In this paper, we present a branch-and-bound algorithm for the exact solution of the Tree QAP based on an ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback