Rosetta Code

Knapsack problem

Revision as of 17:18, 30 May 2010 by Underscore (talk | contribs) (Copyediting.)

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=139485"