Issue No. 10 - Oct. (1985 vol. 34)
Ten-Hwang Lai , Department of Computer and Information Science, The Ohio State University, Columbus, OH 43210
Alan Sprague , Department of Computer and Information Science, The Ohio State University, Columbus, OH 43210
We study the performance of parallel best-bound-first branch-and-bound algorithms, in which several nodes with least lower bounds are expanded simultaneously. It is well known that anomalies may occur in the execution of a parallel branch-and-bound algorithm. We show conditions under which anomalies are guaranteed not to occur when the number of processors is doubled, or not even doubled.
parallel computation, Anomaly, best-bound-first, branch-and-bound
T. Lai and A. Sprague, "Performance of parallel branch-and-bound algorithms," in IEEE Transactions on Computers, vol. 34, no. , pp. 962-964, 1985.