knapsack problem
Sign in to saveAlso known as rucksack problem, backpack problem
problem in combinatorial optimization
Wikidata facts
- Image
- Knapsack.svg
Show 1 more fact
- Stack Exchange tag
- stackoverflow.com/tags/knapsack-problem
Sources (2)
via Wikidata · CC0
~38 min read
Article
Example of a one-dimensional (constraint) knapsack problem: which books should be chosen to maximize the books' value while still keeping the overall weight under or equal to 15 kg? A multiple constrained problem could consider both the weight and volume of the books. (Solution: if any number of each book is available, then three yellow books and three grey books; if only the shown books are available, then all except for the green book.)
The knapsack problem is the following problem in combinatorial optimization:
Connections
polynomial-time approximation scheme
Entity
pseudo-polynomial time
Entity
International Standard Book Number
Entity
real number
Entity
rational number
Entity
Wayback Machine
Entity
cryptography
Entity
digital object identifier
Entity
International Standard Serial Number
Entity
greatest common divisor
Entity
empty set
Entity
Turing machine
Entity
JSTOR
Organization
bibcode
Entity
backpack
Entity
Q118398
Entity
parallel computing
Entity
public-key cryptography
Entity
binary search algorithm
Entity
pseudocode
Entity