Parallel branch-and-bound algorithms: Survey and synthesis

The authors present a detailed and up-to-date survey of the literature on parallel branch-and-bound algorithms. They 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 the present analysis, they give a new characterization of branch-and-bound algorithms, which consists of isolating the performed operations without specifying any particular order for their execution.