Simple approaches to parallel branch and bound
From MaRDI portal
Publication:1208509
DOI10.1016/0167-8191(93)90044-LzbMath0809.65060MaRDI QIDQ1208509
Publication date: 16 May 1993
Published in: Parallel Computing (Search for Journal in Brave)
combinatorial optimization; parallel processing; branch and bound algorithm; NP-complete optimization; search-based enumeration
65K05: Numerical mathematical programming methods
90C27: Combinatorial optimization
65Y05: Parallel numerical computation
Related Items
Parallel algorithms for a multi-level network optimization problem, A survey for the quadratic assignment problem, Location and layout planning. A survey, An extreme point algorithm for a local minimum solution to the quadratic assignment problem