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

DOI10.1016/0167-8191(89)90069-0zbMath0684.65064OpenAlexW2027353576MaRDI QIDQ1825604

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

optimizationperformance analysisparallelizationnumerical comparisonBest-bound-first parallel branch-and-bound algorithms

Mathematics Subject Classification ID

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

Related Items (3)

Conditional optimization problems: fractional order case ⋮ Parallel processing for difficult combinatorial optimization problems ⋮ Design of parallel algorithms for the single resource allocation problem

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