Observations on optimal parallelizations of two-list algorithm

DOI10.1016/J.PARCO.2009.09.005zbMath1205.68501OpenAlexW2035943313MaRDI QIDQ991072

Horacio Hideki Yanasse, Nei Yoshihiro Soma, Carlos Alberto Alonso Sanches

Publication date: 2 September 2010

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

Full work available at URL: https://doi.org/10.1016/j.parco.2009.09.005

zbMATH Keywords

knapsack problemparallel algorithmsubset-sum problemtwo-list algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10)

Cites Work

• An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem
• A parallel two-list algorithm for the knapsack problem
• Comments on parallel algorithms for the knapsack problem.
• Computing Partitions with Applications to the Knapsack Problem

This page was built for publication: Observations on optimal parallelizations of two-list algorithm