Efficiency considerations in the implementation of parallel branch-and-bound
- 1 February 1993
- journal article
- section ii-algorithms-for-parallel-computers
- Published by Springer Nature in Annals of Operations Research
- Vol. 43 (2), 123-145
- https://doi.org/10.1007/bf02024489
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Branch-and-bound as a higher-order functionAnnals of Operations Research, 1991
- Implementation of parallel branch-and-bound algorithms – experiences with the graph partitioning problemAnnals of Operations Research, 1991
- Superlinear speedup of an efficient sequential algorithm is not possibleParallel Computing, 1986
- Anomalies in parallel branch-and-bound algorithmsCommunications of the ACM, 1984
- MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search ProblemsIEEE Transactions on Computers, 1984
- Termination detection for distributed computationsInformation Processing Letters, 1984
- Modeling Unusual Behavior of Parallel AlgorithmsIEEE Transactions on Computers, 1982
- An algorithm for the steiner problem in graphsNetworks, 1982
- An Algorithm for the Traveling Salesman ProblemOperations Research, 1963