Statements (27)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
mathematical optimization
|
| gptkbp:application |
cryptography
finance resource allocation project selection |
| gptkbp:describes |
selection of items with given weights and values
|
| gptkbp:field |
gptkb:mathematics
computer science operations research |
| gptkbp:firstDescribed |
19th century
|
| gptkbp:goal |
maximize total value without exceeding weight limit
|
| gptkbp:hasVariant |
gptkb:0-1_knapsack_problem
gptkb:fractional_knapsack_problem gptkb:multi-dimensional_knapsack_problem gptkb:multi-objective_knapsack_problem |
| https://www.w3.org/2000/01/rdf-schema#label |
knapsack problem
|
| gptkbp:isNPComplete |
true
|
| gptkbp:nameOrigin |
gptkb:knapsack_(backpack)
|
| gptkbp:relatedTo |
gptkb:bin_packing_problem
subset sum problem |
| gptkbp:solvedBy |
dynamic programming
branch and bound greedy algorithm (for fractional version) |
| gptkbp:bfsParent |
gptkb:Merkle–Hellman_knapsack_cryptosystem
gptkb:Branch_and_Bound gptkb:Subset_sum_problem |
| gptkbp:bfsLayer |
6
|