|
gptkbp:instanceOf
|
gptkb:Integer_Programming_Problem
gptkb:NP-hard_Problem
gptkb:Resource_Allocation_Problem
Combinatorial Optimization Problem
|
|
gptkbp:application
|
gptkb:Logistics
Finance
Cryptography
Resource Allocation
|
|
gptkbp:complexity
|
NP-complete
|
|
gptkbp:field
|
gptkb:Mathematics
Computer Science
Operations Research
|
|
gptkbp:firstDescribed
|
1897
|
|
gptkbp:goal
|
Maximize Total Value
|
|
gptkbp:hasApproximateSolution
|
gptkb:Genetic_Algorithms
gptkb:Greedy_Algorithm
gptkb:Metaheuristics
gptkb:Simulated_Annealing
|
|
gptkbp:hasExactSolution
|
gptkb:Dynamic_Programming
|
|
gptkbp:hasVariant
|
gptkb:0-1_Knapsack_Problem
gptkb:Fractional_Knapsack_Problem
gptkb:Multi-constraint_Knapsack_Problem
gptkb:Multi-dimensional_Knapsack_Problem
gptkb:Multi-objective_Knapsack_Problem
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Knapsack Problem
|
|
gptkbp:input
|
Set of Items
Value of Items
Weight Limit
|
|
gptkbp:notableFor
|
gptkb:Bellman’s_Dynamic_Programming
gptkb:Greedy_Method_(for_Fractional_Knapsack)
|
|
gptkbp:parameter
|
Capacity
Item Values
Item Weights
Number of Items
|
|
gptkbp:prohibits
|
Total Weight ≤ Capacity
|
|
gptkbp:relatedTo
|
gptkb:Bin_Packing_Problem
gptkb:Set_Cover_Problem
gptkb:Subset_Sum_Problem
|
|
gptkbp:solvedBy
|
gptkb:Dynamic_Programming
gptkb:Branch_and_Bound
gptkb:Greedy_Algorithm
Approximation Algorithms
|
|
gptkbp:usedIn
|
gptkb:Budget_Management
gptkb:Cutting_Stock_Problem
Portfolio Optimization
Cargo Loading
Project Selection
|
|
gptkbp:bfsParent
|
gptkb:Dynamic_Programming
gptkb:Karp's_21_NP-complete_problems
gptkb:Combinatorial_Optimization
gptkb:Integer_Programming
gptkb:Reducibility_Among_Combinatorial_Problems_(Karp,_1972)
|
|
gptkbp:bfsLayer
|
6
|