1. A. de Bruin, A. H. G. Rinnooy Kan and H. Trienekens, “A Simulation Tool for the Performance of Parallel Branch and Bound Algorithms”, Math. Prog. 42 (1988), p. 245–271.
2. J. Clausen and M. Perregaard, “On the Best Search Strategy in Parallel Branch-and-Bound - Best-First-Search vs. Lazy Depth-First-Search”, Proceedings of POC96 (1996), also DIKU Report 96/14, 11 p.
3. J. Clausen, J. L. Traff, “Implementation of parallel Branch-and-Bound algorithms - experiences with the graph partitioning problem”, Annals of Oper. Res. 33 (1991) 331–349.
4. J. Clausen and J. L. Träff, “Do Inherently Sequential Branch-and-Bound Algorithms Exist?”, Parallel Processing Letters 4, 1-2 (1994), p. 3–13.
5. J. Clausen and M. Perregaard, “Solving Large Quadratic Assignment Problems in Parallel”, DIKU report 1994/22, 14 p., to appear in Computational Optimization and Applications.