An improved parallel algorithm for 0/1 knapsack problem
From MaRDI portal
Publication:1195150
DOI10.1016/0167-8191(92)90047-BzbMath0792.68050OpenAlexW2081963429MaRDI QIDQ1195150
Publication date: 8 November 1992
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-8191(92)90047-b
Related Items (3)
A new algorithm for the integer knapsack problem and its parallelization ⋮ From the theory to the tools: parallel dynamic programming ⋮ LINEAR ARRAY FOR A CLASS OF NON UNIFORM RECURRENCE EQUATIONS
This page was built for publication: An improved parallel algorithm for 0/1 knapsack problem