|
gptkbp:instanceOf
|
gptkb:mathematical_optimization
|
|
gptkbp:complexity
|
polynomial time for fractional knapsack
pseudo-polynomial time for 0-1 knapsack
|
|
gptkbp:field
|
gptkb:mathematics
computer science
operations research
|
|
gptkbp:firstDescribed
|
1897
|
|
gptkbp:goal
|
maximize total value without exceeding capacity
|
|
gptkbp:hasApplication
|
cryptography
finance
resource allocation
project selection
|
|
gptkbp:hasVariant
|
gptkb:0-1_knapsack_problem
gptkb:fractional_knapsack_problem
gptkb:multi-dimensional_knapsack_problem
gptkb:multi-objective_knapsack_problem
|
|
gptkbp:input
|
capacity of knapsack
set of items
value of each item
weight of each item
|
|
gptkbp:namedAfter
|
gptkb:knapsack_(backpack)
|
|
gptkbp:NP-complete
|
yes
|
|
gptkbp:relatedTo
|
gptkb:bin_packing_problem
subset sum problem
partition problem
|
|
gptkbp:supportsAlgorithm
|
dynamic programming
greedy algorithm
branch and bound
|
|
gptkbp:bfsParent
|
gptkb:NP_languages
gptkb:0-1_Integer_Programming
|
|
gptkbp:bfsLayer
|
7
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Knapsack problem
|