A study of parallel branch-and-bound algorithms with best-bound-first search.

José M. Troya M. Ortega A study of parallel branch-and-bound algorithms with best-bound-first search. 121-126 1989 11 Parallel Computing 1 db/journals/pc/pc11.html#TroyaO89