next up previous
Next: Question: Up: CSE 2320: Algorithms and Previous: Proving Greedy Algorithms Optimal

Example: Fractional Knapsack Problem

A thief considers taking W pounds of loot. The loot is in the form of n items, each with weight wi and value vi. Any amount of an item can be put in the knapsack as long as the weight limit W is not exceeded.

Copyright © 1998 The University of Texas at Arlington