Operations Research · 1994 · 324 citations · 81 references
ComputingComputer EngineeringComputer ScienceAlgorithmsParallel AlgorithmsParallel ComputingAlgorithm AnalysisBranch And BoundData ParallelismParallel Algorithm DesignParallel ArchitecturesParallel Computer ArchitectureParallel Branch And Bound
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.
81
Branch-and-Bound Methods: A Survey
Eugene L. Lawler, Derek Wood · Operations Research · 1966 · 2K citations
Very high-speed computing systems
Michael Flynn · Proceedings of the IEEE · 1966 · 951 citations
Branch-and-Bound Methods: General Formulation and Properties
L. G. Mitten · Operations Research · 1970 · 331 citations