Knapsack problem

From Rosetta Code
(Redirected from Knapsack Problem)
Jump to: navigation, search

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:

Personal tools
Namespaces

Variants
Actions
Community
Explore
Misc
Toolbox