1. Reverse search for enumeration;Avis;Discrete Appl. Math.,1996
2. A branch-and-bound-based heuristic for solving the quadratic assignment problem;Bazaraa;Naval Res. Logist.,1983
3. A parallel best-first branch and bound algorithm for the traveling salesperson problem;Brüngger,1995
4. Joining forces in solving large-scale QAP in parallel;Brüngger,1997
5. A. Brüngger, A. Marzetta, K. Fukuda, J. Nievergelt, The parallel exhaustive search workbench ZRAM and its applications, Ann. Oper. Res.