Michael Adams 1. Items with weights and values Knapsack with weight capacity Highest value selection under capacity NP-hard Combinatorial optimization.
A Random Parallel Approximation Algorithm for the 0-1 Knapsack Problem
