Parallel Branch-And-Bound Algorithms: Survey and Synthesis

We present a detailed and up-to-date survey of the literature on parallel branch-and-bound algorithms. We synthesize previous work in this area and propose a new classification of parallel branch-and-bound algorithms. This classification is used to analyze the methods proposed in the literature. To...

Full description

Saved in:
Bibliographic Details
Published inOperations research Vol. 42; no. 6; pp. 1042 - 1066
Main Authors Gendron, Bernard, Crainic, Teodor Gabriel
Format Journal Article
LanguageEnglish
Published Linthicum, MD Operations Research Society of America 01.11.1994
Institute for Operations Research and the Management Sciences
Subjects
Algorithms
Application service providers
Applied sciences
Architectural models
Architecture
Computer architecture
Exact sciences and technology
Multiprocessors
Operational research and scientific management
Operational research. Management science
Operations research
Optimal solutions
Optimization. Search problems
Parallel computing
Parallel processing
Slaves
Studies
Transputers
Parallel algorithm
Review
Branch and bound method
Optimization method
NP hard problem
Online AccessGet full text

Cover

More Information
Summary:We present a detailed and up-to-date survey of the literature on parallel branch-and-bound algorithms. We synthesize previous work in this area and propose a new classification of parallel branch-and-bound algorithms. This classification is used to analyze the methods proposed in the literature. To facilitate our analysis, we give a new characterization of branch-and-bound algorithms, which consists of isolating the performed operations without specifying any particular order for their execution.
ISSN:0030-364X
1526-5463
DOI:10.1287/opre.42.6.1042