This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Oct. 1985 (vol. 34 no. 10)
pp. 962-964
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.
Index Terms:
parallel computation,Anomaly,best-bound-first,branch-and-bound
Citation:
Ten-Hwang Lai, Alan Sprague, "Performance of parallel branch-and-bound algorithms," IEEE Transactions on Computers, vol. 34, no. 10, pp. 962-964, Oct. 1985, doi:10.1109/TC.1985.6312201
Usage of this product signifies your acceptance of the Terms of Use.