The two list algorithm for the knapsack problem on an FPS T20
From MaRDI portal
Publication:1118989
DOI10.1016/0167-8191(89)90121-XzbMath0669.65051MaRDI QIDQ1118989
Hugo Herbelin, Michel Cosnard, Afonso G. Ferreira
Publication date: 1989
Published in: Parallel Computing (Search for Journal in Brave)
hypercube; parallel computation; knapsack problem; parallel algorithms; NP-complete; exponential complexity; two-list algorithm; Branch and bound algorithms
Related Items
On the convergence of the sequences of Gerschgorin-like disks, On Euler-like methods for the simultaneous approximation of polynomial zeros, Solving knapsack problems on GPU