Anonymous user
Knapsack problem: Difference between revisions
m
Added some very simple descriptive text
(Update with Knapsack problem/Continuous) |
m (Added some very simple descriptive text) |
||
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:
* [[Knapsack problem/Unbounded]]
| |||