Knapsack problem

From Rosetta Code
Revision as of 22:23, 10 February 2013 by rosettacode>Markhobley (category)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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:

Retrieved from "https://rosettacode.org/wiki/Knapsack_problem?oldid=139486"