Statements (26)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
mathematical optimization
NP-complete problem |
| gptkbp:alsoKnownAs |
gptkb:0-1_knapsack_problem
|
| gptkbp:complexity |
exponential time (brute force)
pseudo-polynomial time (dynamic programming) |
| gptkbp:goal |
maximize total value without exceeding capacity
|
| gptkbp:hasApplication |
cryptography
finance resource allocation |
| gptkbp:hasFirstFormalization |
19th century
|
| gptkbp:hasRelatedProblem |
gptkb:fractional_knapsack_problem
gptkb:multi-dimensional_knapsack_problem subset sum problem |
| gptkbp:hasSolutionMethod |
dynamic programming
branch and bound greedy approximation |
| gptkbp:hasSpecialCase |
gptkb:knapsack_problem
|
| https://www.w3.org/2000/01/rdf-schema#label |
binary knapsack problem
|
| gptkbp:input |
set of items
maximum weight capacity value for each item weight for each item |
| gptkbp:prohibits |
each item can be chosen at most once
|
| gptkbp:bfsParent |
gptkb:0-1_knapsack_problem
gptkb:0-1_Knapsack_Problem |
| gptkbp:bfsLayer |
8
|