Knapsack problem

From Rosetta Code

Knapsack problems are ones where 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 problems.

See:

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