A parallel algorithm for the 0-1 knapsack problem.
W. LootsT. H. C. SmithPublished in: Int. J. Parallel Program. (1992)
Keyphrases
- knapsack problem
- parallel algorithm
- combinatorial optimization problems
- optimal solution
- optimization problems
- dynamic programming
- parallel computation
- np hard
- exact algorithms
- parallel programming
- linear programming relaxation
- shared memory
- multidimensional knapsack problem
- binary search trees
- discovery of association rules
- maximum profit
- parallel implementations
- medial axis transform
- implicit enumeration
- cluster of workstations
- greedy heuristic
- lower bound
- parallel version
- continuous relaxation
- neural network
- vehicle routing problem
- metaheuristic
- orders of magnitude
- search space
- genetic algorithm
- machine learning