Efficiency considerations in the implementation of parallel branch-and- bound

DOI10.1007/BF02024489zbMath0784.90108MaRDI QIDQ1309863

G. P. McKeown, S. A. Rush, V. J. Rayward-Smith

Publication date: 20 December 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

transputer networkbranch-and-bound paradigm

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mathematical programming (90C99)

Related Items

PEBBL: an object-oriented framework for scalable parallel branch and bound, Parallel branch and bound for multidimensional scaling with city-block distances, Parallel processing for difficult combinatorial optimization problems, An application of parallel virtual machine framework to film production problem

Cites Work

• Superlinear speedup of an efficient sequential algorithm is not possible
• Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem
• Branch-and-bound as a higher-order function
• MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
• Anomalies in parallel branch-and-bound algorithms
• An Algorithm for the Traveling Salesman Problem
• An algorithm for the steiner problem in graphs