Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
mathematical optimization greedy algorithm problem |
| gptkbp:allows |
items to be broken into fractions
|
| gptkbp:complexity |
O(n log n)
|
| gptkbp:contrastsWith |
gptkb:0-1_knapsack_problem
|
| gptkbp:firstDescribed |
20th century
|
| https://www.w3.org/2000/01/rdf-schema#label |
fractional knapsack problem
|
| gptkbp:objective |
maximize total value in knapsack
|
| gptkbp:prohibits |
total weight does not exceed capacity
|
| gptkbp:relatedTo |
gptkb:knapsack_problem
|
| gptkbp:solutionProperty |
optimal solution can be found by sorting items by value-to-weight ratio
|
| gptkbp:solvedBy |
greedy algorithm
|
| gptkbp:usedIn |
computer science
operations research resource allocation |
| gptkbp:bfsParent |
gptkb:knapsack_problem
gptkb:Knapsack_problem |
| gptkbp:bfsLayer |
7
|