Anomalies in parallel branch-and-bound algorithms
Conference
·
OSTI ID:5248823
The authors 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/sub 2/ processors to take more time than one using n/sub 1/ processors even though n/sub 1/ < n/sub 2/. Furthermore, it is also possible to achieve speedups that are in excess of the ratio n/sub 2//n/sub 1/. Experimental results with the o/1 knapsack and traveling salesperson problems are also presented. 14 references.
- OSTI ID:
- 5248823
- Report Number(s):
- CONF-8308190-
- Resource Relation:
- Conference: 12. IEEE international conference on parallel processing, Bellaire, MI, USA, 21 Aug 1983
- Country of Publication:
- United States
- Language:
- English
Similar Records
Anomalies in parallel branch-and-bound algorithms
Randomized algorithms for parallel backtracking and branch-and-bound
A randomized parallel branch-and-bound algorithm
Technical Report
·
Wed Dec 01 00:00:00 EST 1982
·
OSTI ID:5248823
Randomized algorithms for parallel backtracking and branch-and-bound
Thesis/Dissertation
·
Fri Jan 01 00:00:00 EST 1988
·
OSTI ID:5248823
A randomized parallel branch-and-bound algorithm
Journal Article
·
Wed Jun 01 00:00:00 EDT 1988
· International Journal of Parallel Programming; (USA)
·
OSTI ID:5248823
+1 more