Knapsack problem: Difference between revisions
Content added Content deleted
(Update with Knapsack problem/Continuous) |
m (category) |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Line 1: | 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: |
See: |
||
* [[Knapsack problem/Unbounded]] |
* [[Knapsack problem/Unbounded]] |
||
| Line 4: | Line 6: | ||
* [[Knapsack problem/0-1]] |
* [[Knapsack problem/0-1]] |
||
* [[Knapsack problem/Continuous]] |
* [[Knapsack problem/Continuous]] |
||
[[Category:Puzzles]] |
|||
Latest revision as of 22:23, 10 February 2013
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: