Ignore this box please.
More
Settings
Goodies
About
Help
Feedback
PRIVACY
DontTrack
DontBubble
Policy
COMMUNITY
Platform
Forum
Chat
Spread
Keyboard shortcuts
h, / search box
j, ↓ next result
k, ↑ prev result
l, o, Enter go
More...
Ctrl+Enter bg
', v new tab
d domain search
t Top
!, 1 !bang dropdown
esc out of bangs
s Did you mean
r related topics
m main results
More explanation...
Knapsack problem
The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible.
More at Wikipedia
Packing problem
Cutting stock problem
More related topics
Continuous knapsack problem
Combinatorial optimization
Combinatorial auction
Dynamic programming
Combinatorial optimization
NP-complete problems
Weakly NP-complete problems
Operations research
Cryptography
This page requires Javascript.Get the non-JS version
here
.