Anonymous user
Knapsack problem: Difference between revisions
m
category
(Add Bounded) |
m (category) |
||
(3 intermediate revisions by 3 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]]
|