Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
mathematical optimization
|
| gptkbp:allows |
taking fractions of items
|
| gptkbp:category |
mathematical optimization
|
| gptkbp:compatibleWith |
only whole items
|
| gptkbp:complexity |
O(n log n)
|
| gptkbp:firstDescribed |
gptkb:George_Dantzig
|
| gptkbp:hasVariant |
gptkb:0-1_Knapsack_Problem
|
| https://www.w3.org/2000/01/rdf-schema#label |
Fractional Knapsack Problem
|
| gptkbp:input |
knapsack capacity
list of items with weights and values |
| gptkbp:objective |
maximize total value in knapsack
|
| gptkbp:prohibits |
total weight does not exceed capacity
|
| gptkbp:relatedTo |
gptkb:Knapsack_Problem
|
| gptkbp:solvedBy |
greedy algorithm
repeat until knapsack is full sort items by value-to-weight ratio take as much as possible of highest ratio item |
| gptkbp:usedIn |
computer science
operations research resource allocation |
| gptkbp:bfsParent |
gptkb:Knapsack_Problem
|
| gptkbp:bfsLayer |
7
|