|
gptkbp:instanceOf
|
mathematical optimization
|
|
gptkbp:alsoKnownAs
|
gptkb:binary_knapsack_problem
|
|
gptkbp:application
|
cryptography
finance
resource allocation
project selection
|
|
gptkbp:complexity
|
NP-complete
|
|
gptkbp:estimatedCost
|
gptkb:fully_polynomial-time_approximation_scheme_(FPTAS)
|
|
gptkbp:field
|
gptkb:mathematics
computer science
operations research
|
|
gptkbp:firstDescribed
|
1957
|
|
gptkbp:generalizes
|
gptkb:fractional_knapsack_problem
gptkb:multi-dimensional_knapsack_problem
gptkb:multi-objective_knapsack_problem
|
|
gptkbp:goal
|
maximize total value without exceeding weight
|
|
gptkbp:hasSpecialCase
|
subset sum problem
partition problem
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
0-1 knapsack problem
|
|
gptkbp:input
|
set of items
maximum weight capacity
value for each item
weight for each item
|
|
gptkbp:output
|
subset of items
|
|
gptkbp:partOf
|
gptkb:knapsack_problems
|
|
gptkbp:prohibits
|
each item can be chosen at most once
|
|
gptkbp:relatedTo
|
gptkb:knapsack_problem
subset sum problem
|
|
gptkbp:solvedBy
|
dynamic programming
branch and bound
greedy approximation
|
|
gptkbp:bfsParent
|
gptkb:knapsack_problem
gptkb:Knapsack_problem
|
|
gptkbp:bfsLayer
|
7
|