Knapsack problem - Rosetta Code (original) (raw)

(Redirected from Knapsack Problem)

In a knapsack problem, the goal is to maximize some value subject to a set of constraints. Though the continuous case is very simple, the discrete cases are NP-complete.

See:

• Knapsack problem/Unbounded
• Knapsack problem/Bounded
• Knapsack problem/0-1
• Knapsack problem/Continuous

Cookies help us deliver our services. By using our services, you agree to our use of cookies.