Can Parallel Branch and Bound without Communication Be Effective?

DOI10.1137/0804016zbMath0806.65061OpenAlexW1977696615MaRDI QIDQ4302313

Per. S. Laursen

Publication date: 14 August 1994

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0804016

zbMATH Keywords

quadratic assignment problemparallel algorithmbranch and bound algorithmgraph partitioning problemweighted vertex cover problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Parallel numerical computation (65Y05)

Related Items (3)

An experimental comparison of three heuristics for the WVCP ⋮ Parallel algorithms for a multi-level network optimization problem ⋮ SelfSplit parallelization for mixed-integer linear programming

This page was built for publication: Can Parallel Branch and Bound without Communication Be Effective?