Multi-dimensional Knapsack Problem
GPTKB entity
Statements (27)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_optimization
|
| gptkbp:abbreviation |
MDKP
|
| gptkbp:alsoKnownAs |
gptkb:Multi-constraint_Knapsack_Problem
|
| gptkbp:complexity |
gptkb:NP-hard
|
| gptkbp:firstDescribed |
1970s
|
| gptkbp:generalizes |
gptkb:Knapsack_Problem
|
| gptkbp:hasApplication |
Resource allocation
Portfolio optimization Budget management Cargo loading |
| gptkbp:objective |
Maximize total profit
|
| gptkbp:parameter |
Capacity vector
Profit values Weight matrix |
| gptkbp:prohibits |
Multiple resource constraints
|
| gptkbp:relatedTo |
gptkb:Subset_sum_problem
Bin packing problem Multiple-choice Knapsack Problem |
| gptkbp:solvedBy |
gptkb:Branch_and_bound
gptkb:Metaheuristics Dynamic programming Greedy approximation |
| gptkbp:type |
Linear constraints
|
| gptkbp:variant |
Item selection variables
|
| gptkbp:bfsParent |
gptkb:Knapsack_Problem
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
Multi-dimensional Knapsack Problem
|