Adaptive and Cost-Optimal Parallel Algorithm for the 0-1 Knapsack Problem.
Kenli LiLingxiao LiTeklay TesfazghiEdwin Hsing-Mean ShaPublished in: PDP (2011)
Keyphrases
- parallel algorithm
- knapsack problem
- optimal solution
- decision variables
- dynamic programming
- binary search trees
- implicit enumeration
- combinatorial optimization problems
- maximum profit
- greedy heuristic
- parallel computation
- optimization problems
- exact algorithms
- np hard
- linear programming relaxation
- multidimensional knapsack problem
- shared memory
- parallel programming
- minimum cost
- discovery of association rules
- greedy algorithm
- search space
- linear programming
- upper bound
- branch and bound
- cluster of workstations
- neural network
- lower bound
- parallel implementations
- optimal planning
- linear program