Performance of parallel branch-and-bound algorithms

DOI10.1109/TC.1985.6312201zbMath0569.68026OpenAlexW2051586165MaRDI QIDQ3686027

Alan P. Sprague, Ten-Hwang Lai

Publication date: 1985

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1985.6312201

zbMATH Keywords

parallel computationanomaliesparallel best-bound-first branch-and-bound algorithms

Mathematics Subject Classification ID

Theory of operating systems (68N25) Algorithms in computer science (68W99)

Related Items (8)

Branch-and-bound and parallel computation: A historical note ⋮ A note on anomalies in parallel branch-and-bound algorithms with one-to- one bounding functions ⋮ Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem ⋮ Performances of parallel branch and bound algorithms with best-first search ⋮ An efficient data structure for branch-and-bound algorithm ⋮ Large-scale 0-1 linear programming on distributed workstations ⋮ Parallel processing for difficult combinatorial optimization problems ⋮ A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF

This page was built for publication: Performance of parallel branch-and-bound algorithms