Knapsack problem
= Knapsack problem
{wiki}
The knapsack problem selects items of prescribed weights and profits under a total-weight capacity. The <0-1 knapsack problem> permits each item at most once; bounded and unbounded multiplicity variants use different integer restrictions. Nonnegative weights and capacity are assumed here.