Anonymous user
Knapsack problem: Difference between revisions
m
category
(moved Knapsack problem to Knapsack problem/unbounded: This task is in point of fact the "unbounded knapsack problem" see the wikipedia! [http://en.wikipedia.org/wiki/Knapsack_problem]) |
m (category) |
||
| (5 intermediate revisions by 4 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.
#REDIRECT [[Knapsack problem/unbounded]]▼
See:
* [[Knapsack problem/Bounded]]
* [[Knapsack problem/0-1]]
* [[Knapsack problem/Continuous]]
[[Category:Puzzles]]
| |||