A parallel two-list algorithm for the knapsack problem

DOI10.1016/S0167-8191(96)00085-3zbMath0906.68079OpenAlexW2064207223WikidataQ127451684 ScholiaQ127451684MaRDI QIDQ1392066

Der-Chyuan Lou, Chin-Chen Chang

Publication date: 23 July 1998

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

Full work available at URL: https://doi.org/10.1016/s0167-8191(96)00085-3

zbMATH Keywords

NP-complete problemsknapsack problemparallel algorithmscryptosystem

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items

An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem, Solving knapsack problems on GPU, Observations on optimal parallelizations of two-list algorithm