Knapsack problem: Difference between revisions

Knapsack problem (view source)

274 bytes added , 11 years ago

m

Revision as of 21:09, 14 February 2010 (view source) Underscore (talk \| contribs) (Changed from a redirect to a disambiguation page.) ← Older edit		Latest revision as of 22:23, 10 February 2013 (view source) rosettacode>Markhobley m (category)
(4 intermediate revisions by 4 users not shown)
Line 1: In a knapsack problem, the goal is to maximize some value subject to a set of constraints. Though the [[/Continuous\|continuous case]] is very simple, the discrete cases are NP-complete. See: * [[Knapsack problem/Unbounded]] * [[Knapsack problem/Bounded]] * [[Knapsack problem/0-1]] * [[Knapsack problem/Continuous]] [[Category:Puzzles]]