Performance of parallel branch-and-bound algorithms

DOI10.1109/TC.1985.6312201MaRDI QIDQ3686027zbMATH OpenOpenAlexFDO

Authors Alan P. Sprague, Ten H. 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

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

Recommendations

• Anomalies in parallel branch-and-bound algorithms
• Performances of parallel branch and bound algorithms with best-first search
• A simulation tool for the performance evaluation of parallel branch and bound algorithms
• A study of parallel branch-and-bound algorithms with best-bound-first search
• Simple approaches to parallel branch and bound

Cited in

(25)

• A study of parallel branch-and-bound algorithms with best-bound-first search
• A note on anomalies in parallel branch-and-bound algorithms with one-to- one bounding functions
• Parallel best-first branch-and-bound in discrete optimization: a framework
• Performances of parallel branch and bound algorithms with best-first search
• Anomalies in parallel branch-and-bound algorithms
• Performance analysis of branch-and-bound skeletons
• An efficient data structure for branch-and-bound algorithm
• Experience of multilevel parallelizing of the branch and bound method in discrete optimization problems
• Mitigating anomalies in parallel branch-and-bound based algorithms for mixed-integer nonlinear optimization
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis
• scientific article; zbMATH DE number 5168311 (Why is no real title available?)
• Large-scale 0-1 linear programming on distributed workstations
• An upper bound for the speedup of parallel best-bound branch-and-bound algorithms
• Branch-and-bound and parallel computation: A historical note
• A simulation tool for the performance evaluation of parallel branch and bound algorithms
• scientific article; zbMATH DE number 3845046 (Why is no real title available?)
• A Queueing Network Model for Analyzing a Class of Branch-and-Bound Algorithms on a Master–Slave Architecture
• A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF
• Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem
• Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
• scientific article; zbMATH DE number 1057779 (Why is no real title available?)
• Anomalies in distributed branch-and-cut solving of the CVRP with different search strategies
• Efficiency considerations in the implementation of parallel branch-and- bound
• Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5
• Parallel processing for difficult combinatorial optimization problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686027)