Statements (29)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
mathematical optimization
|
| gptkbp:alsoKnownAs |
gptkb:binary_knapsack_problem
|
| gptkbp:application |
cryptography
finance resource allocation budget management |
| gptkbp:complexity |
NP-complete
|
| gptkbp:field |
gptkb:mathematics
computer science operations research |
| gptkbp:firstDescribed |
early 20th century
|
| gptkbp:hasPolynomialTimeApproximationScheme |
yes
|
| https://www.w3.org/2000/01/rdf-schema#label |
0-1 Knapsack Problem
|
| gptkbp:input |
set of items
maximum weight capacity value for each item weight for each item |
| gptkbp:output |
subset of items maximizing value without exceeding capacity
|
| gptkbp:prohibits |
each item can be chosen at most once
|
| gptkbp:relatedTo |
gptkb:fractional_knapsack_problem
gptkb:multi-dimensional_knapsack_problem |
| gptkbp:solvedBy |
dynamic programming
branch and bound greedy approximation |
| gptkbp:type |
NP-complete
|
| gptkbp:usedIn |
theoretical computer science
algorithm design |
| gptkbp:bfsParent |
gptkb:Knapsack_Problem
|
| gptkbp:bfsLayer |
7
|