A study of parallel branch-and-bound algorithms with best-bound-first search

DOI10.1016/0167-8191(89)90069-0MaRDI QIDQ1825604zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 1989

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(89)90069-0

zbMATH Keywords

Best-bound-first parallel branch-and-bound algorithmsnumerical comparisonoptimizationparallelizationperformance analysis

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Nonlinear programming (90C30)

Recommendations

• Simple approaches to parallel branch and bound
• Performance of parallel branch-and-bound algorithms
• Performances of parallel branch and bound algorithms with best-first search
• scientific article; zbMATH DE number 934536
• Anomalies in parallel branch-and-bound algorithms

Cited in

(18)

• An upper bound for the speedup of parallel best-bound branch-and-bound algorithms
• Simple approaches to parallel branch and bound
• Parallel processing for difficult combinatorial optimization problems
• Design of parallel algorithms for the single resource allocation problem
• On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search
• Performances of parallel branch and bound algorithms with best-first search
• Conditional optimization problems: fractional order case
• An analysis of budgeted parallel search on conditional Galton-Watson trees
• Evaluation of a simple, scalable, parallel best-first search strategy
• Performance of parallel branch-and-bound algorithms
• Stochastic Modeling of Branch-and-Bound Algorithms with Best-First Search
• scientific article; zbMATH DE number 1304347 (Why is no real title available?)
• scientific article; zbMATH DE number 1935510 (Why is no real title available?)
• On hash-based work distribution methods for parallel best-first search
• Cyclic best first search: using contours to guide branch-and-bound algorithms
• scientific article; zbMATH DE number 934534 (Why is no real title available?)
• Parallel branch and bound on fine-grained hypercube multiprocessors
• Performance analysis of branch-and-bound skeletons

This page was built for publication: A study of parallel branch-and-bound algorithms with best-bound-first search

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