knapsack

Knapsack Problem

You have some objects, and a knapsack. The objects have values and weight, and the knapsack have a capacity. What is the set of objects that will have the maximum cost, such that the sum of their weight can fit in the knapsack?