Branch-and-bound and parallel computation: A historical note

Authors:
E.A Pruul;G.L Nemhauser;R.A Rushmeier
Affiliations:
Georgia Institute of Technology, Atlanta, GA 30332, USA;Georgia Institute of Technology, Atlanta, GA 30332, USA;Cornell University, Ithaca, NY 14853, USA
Venue:
Operations Research Letters
Year:
1988

Citing 6
Cited 1

Coping with anomalies in parallel branch-and-bound algorithms

IEEE Transactions on Computers - The MIT Press scientific computation series
An introduction to parallelism in combinatorial optimization

Discrete Applied Mathematics
A note on anomalies in parallel branch-and-bound algorithms with one-to-one bounding functions

Information Processing Letters
Parallel computing in combinatorial optimization

Annals of Operations Research - Special Issue: Parallel Optimization on Novel Computer Architectures
Anomalies in parallel branch-and-bound algorithms

Communications of the ACM
MANIP A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems

IEEE Transactions on Computers

Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This historical note summarizes what we believe to have been the first use of parallel processing to solve a combinatorial optimization problem by a branch-and-bound algorithm. In 1975, a branch-and-bound algorithm for the traveling salesman problem that used p parallel processors with shared memory was simulated on a single processor. The results show that the simultaneous exploration of several nodes of the search tree yields better feasible solutions earlier. This allows earlier pruning of branches and significantly reduces the number of nodes searched.