A cost-optimal parallel algorithm for the 0-1 knapsack problem and its performance on multicore CPU and GPU implementations.
Kenli LiJing LiuLanjun WanShu YinKeqin LiPublished in: Parallel Comput. (2015)
Keyphrases
- parallel algorithm
- knapsack problem
- graphics processors
- parallel programming
- decision variables
- optimal solution
- graphics processing units
- dynamic programming
- shared memory
- parallel computation
- implicit enumeration
- parallel implementations
- maximum profit
- binary search trees
- compute unified device architecture
- cpu implementation
- cluster of workstations
- greedy heuristic
- np hard
- optimization problems
- exact algorithms
- minimum cost
- multicore processors
- general purpose
- gpu implementation
- parallel computing
- greedy algorithm
- pc cluster
- worst case
- linear programming relaxation
- multidimensional knapsack problem
- parallel version
- branch and bound algorithm
- medial axis transform
- linear programming
- efficient implementation
- parallel implementation
- lower bound
- real time
- dna computing
- optimal planning
- objective function