Results 1 
2 of
2
Anomalies in Parallel BranchandBound Algorithms
, 1984
"... We consider the effects of parallelizing branchandbound algorithms by expanding several live nodes simultaneously. It is shown that it is quite possible for a parallel branchandbound algorithm using n 2 processors to take more time than one using n 1 processors even though n 1 < n 2 . Further ..."
Abstract

Cited by 66 (3 self)
 Add to MetaCart
We consider the effects of parallelizing branchandbound algorithms by expanding several live nodes simultaneously. It is shown that it is quite possible for a parallel branchandbound algorithm using n 2 processors to take more time than one using n 1 processors even though n 1 < n 2 . Furthermore, it is also possible to achieve speedups that are in excess of the ratio n 2 /n 1 . Experimental results with the 0/1Knapsack and Traveling Salesperson problems are also presented.