A low-space algorithm for the subset-sum problem on GPU

DOI10.1016/j.cor.2017.02.006zbMath1458.90005OpenAlexW2588454908MaRDI QIDQ1652299

V. V. Curtis, Carlos Alberto Alonso Sanches

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2017.02.006

zbMATH Keywords

parallel algorithmGPUsubset-sum problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Numerical algorithms for specific classes of architectures (65Y10)

Related Items (2)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ An improved balanced algorithm for the subset-sum problem

Uses Software

• CUDA

Cites Work

• An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem
• Parallel time and space upper-bounds for the subset-sum problem
• Solving knapsack problems on GPU
• Computing Partitions with Applications to the Knapsack Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A low-space algorithm for the subset-sum problem on GPU