# Knapsack problem

From Rosetta Code

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:

From Rosetta Code

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: