Simple approaches to parallel branch and bound

DOI10.1016/0167-8191(93)90044-LzbMath0809.65060OpenAlexW2064828380MaRDI QIDQ1208509

Per. S. Laursen

Publication date: 16 May 1993

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(93)90044-l

zbMATH Keywords

combinatorial optimizationparallel processingbranch and bound algorithmNP-complete optimizationsearch-based enumeration

Mathematics Subject Classification ID

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

Related Items (5)

An extreme point algorithm for a local minimum solution to the quadratic assignment problem ⋮ A survey for the quadratic assignment problem ⋮ Parallel algorithms for a multi-level network optimization problem ⋮ On estimating workload in interval branch-and-bound global optimization algorithms ⋮ Location and layout planning. A survey

This page was built for publication: Simple approaches to parallel branch and bound