Performances of parallel branch and bound algorithms with best-first search

DOI10.1016/0166-218X(94)00137-3zbMath0854.68037WikidataQ126310812 ScholiaQ126310812MaRDI QIDQ1917301

Catherine Roucairol, Bernard Mans

Publication date: 7 July 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

bound algorithmparallel branch

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Related Items (2)

Mitigating anomalies in parallel branch-and-bound based algorithms for mixed-integer nonlinear optimization ⋮ Parallel processing for difficult combinatorial optimization problems

Cites Work

• Unnamed Item
• Parallel state-space search for a first solution with consistent linear speedups
• An upper bound for the speedup of parallel best-bound branch-and-bound algorithms
• The general problem solving algorithm and its implementation
• Branching from the largest upper bound. Folklore and facts
• Performance of parallel branch-and-bound algorithms
• Anomalies in parallel branch-and-bound algorithms
• Theoretical comparisons of search strategies in branch-and-bound algorithms
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis

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