Opening book details…
Can I read Anomalies in Parallel Branch-and-bound Algorithms on EtoBox?
Anomalies in Parallel Branch-and-bound Algorithms by Ten-Hwang Lai; Sartaj Sahni is a Computer Science article available to read on EtoBox.
What is Anomalies in Parallel Branch-and-bound Algorithms about?
We consider the effects of parallelizing branch-and-bound algorithms by expanding several live nodes simultaneously. It is shown that it is quite possible for a parallel branch-and-bound 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 speed-ups that are in excess of the ratio n 2 / n 1 . Experimental results with the 0 / 1-Knapsack and Traveling Salesman problems are also presented.
Who reads Anomalies in Parallel Branch-and-bound Algorithms?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Ten-Hwang Lai; Sartaj Sahni
- Publisher
- ACM
- Published
- 1984
- Language
- EN
- Field
- Computer Science (Physical Sciences)