Knapsack problem

From Rosetta Code
Revision as of 10:20, 25 February 2010 by rosettacode>Dkf (Added some very simple descriptive text)

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:

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