1. F.W. Burton, M.M. Huntbach, G.P. McKeown, V.J. Rayward-Smith (1983). Parallelism in Branch-and-Bound Algorithms, Report CSA/3/1983, University of East Anglia, Norwich.
2. R. Corrêa, A. Ferreira (1995a). A distributed implementation of asynchronous parallel branch-and-bound. A. Ferreira & J. Rolim (eds.). Solving Irregular Problems in Parallel: State of the Art, Kluwer, Boston, to appear.
3. R. Corrêa, A. Ferreira (1995b). Modeling parallel branch-and-bound for asynchronous implementations. 1994 DIMACS Workshop on Parallel Processing of Discrete Optimization problems, DIMACS, Piscataway, to appear.
4. B.L. Fox, J.K. Lenstra, A.H.G. Rinnnooy Kan, L.E. Schrage (1978). Branching from the largest upper bound: folklore and facts. European J. Oper. Res. 2, 191–194.
5. T. Ibaraki (1976). Theoretical comparisons of search strategies in branch-and-bound algorithms. Int. J. Comput. Inform. Sci. 5, 315–344.