A low-space algorithm for the subset-sum problem on GPU
- 1 July 2017
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 83, 120-124
Abstract
No abstract availableKeywords
Funding Information
- Capes-ITA and São Paulo Research Foundation (2015/18164-5)
This publication has 9 references indexed in Scilit:
- A novel cooperative accelerated parallel two-list algorithm for solving the subset-sum problem on a hybrid CPU–GPU clusterJournal of Parallel and Distributed Computing, 2016
- Efficient CPU‐GPU cooperative computing for solving the subset‐sum problemConcurrency and Computation: Practice and Experience, 2015
- An efficient solution to the subset‐sum problem on GPUConcurrency and Computation: Practice and Experience, 2015
- A cost-optimal parallel algorithm for the 0–1 knapsack problem and its performance on multicore CPU and GPU implementationsParallel Computing, 2015
- GPU implementation of a parallel two‐list algorithm for the subset‐sum problemConcurrency and Computation: Practice and Experience, 2014
- Solving knapsack problems on GPUComputers & Operations Research, 2011
- Parallel time and space upper-bounds for the subset-sum problemTheoretical Computer Science, 2008
- An optimal and scalable parallelization of the two-list algorithm for the subset-sum problemEuropean Journal of Operational Research, 2007
- Computing Partitions with Applications to the Knapsack ProblemJournal of the ACM, 1974