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. Parallel Computing, 11(1):121-126, 1989.

Abstract

Abstract is missing.