Statements (24)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
mathematical optimization
|
| gptkbp:application |
cryptography
finance resource allocation |
| gptkbp:complexity |
NP-complete (0-1 knapsack)
polynomial time (fractional knapsack) |
| gptkbp:field |
gptkb:mathematics
computer science operations research |
| gptkbp:firstDescribed |
19th century
|
| gptkbp:hasVariant |
gptkb:0-1_knapsack_problem
gptkb:fractional_knapsack_problem gptkb:multi-dimensional_knapsack_problem gptkb:multi-objective_knapsack_problem bounded knapsack problem |
| https://www.w3.org/2000/01/rdf-schema#label |
knapsack problems
|
| gptkbp:namedAfter |
gptkb:knapsack_(backpack)
|
| gptkbp:notableFor |
dynamic programming solution
greedy algorithm (for fractional case) |
| gptkbp:relatedTo |
dynamic programming
NP-complete problems greedy algorithms |
| gptkbp:bfsParent |
gptkb:0-1_knapsack_problem
|
| gptkbp:bfsLayer |
8
|