Knapsack problem: Difference between revisions

Knapsack problem (view source)

3 bytes added , 11 years ago

m

Revision as of 10:20, 25 February 2010 (view source) rosettacode>Dkf m (Added some very simple descriptive text) ← Older edit		Latest revision as of 22:23, 10 February 2013 (view source) rosettacode>Markhobley m (category)
(One intermediate revision by one other user not shown)
Line 1: ~~Knapsack~~In ~~problems~~a ~~are~~knapsack ~~ones where~~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 ~~problems~~. See: Line 6: * [[Knapsack problem/0-1]] * [[Knapsack problem/Continuous]] [[Category:Puzzles]]