Knapsack problem: Difference between revisions

Content added Content deleted

Inline

Revision as of 17:18, 30 May 2010

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:

Revision as of 10:20, 25 February 2010 (view source) rosettacode>Dkf m (Added some very simple descriptive text) ← Older edit		Revision as of 17:18, 30 May 2010 (view source) Underscore (talk \| contribs) m (Copyediting.) Newer edit →
Line 1:		Line 1:
	~~Knapsack~~ ~~problems~~ ~~are~~ ~~ones where~~ 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~~.		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:		See: