Knapsack problem: Difference between revisions
Content added Content deleted
(Update with Knapsack problem/Continuous) |
m (Added some very simple descriptive text) |
||
| 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. |
|||
See: |
See: |
||
* [[Knapsack problem/Unbounded]] |
* [[Knapsack problem/Unbounded]] |
||
Revision as of 10:20, 25 February 2010
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: