The two list algorithm for the knapsack problem on an FPS T20

DOI10.1016/0167-8191(89)90121-XzbMath0669.65051OpenAlexW1976182275MaRDI QIDQ1118989

Hugo Herbelin, Michel Cosnard, Afonso G. Ferreira

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)90121-x

zbMATH Keywords

hypercubeparallel computationknapsack problemparallel algorithmsNP-completeexponential complexitytwo-list algorithmBranch and bound algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (3)

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

This page was built for publication: The two list algorithm for the knapsack problem on an FPS T20