Knapsack problem knapsack problem greedy algorithm GA

knapsack problem knapsack problem Greedy Algorithm GA

Give a point n items, the weight of the article J, the value, the capacity of the backpack for. What items should be selected in the bag so that the total value of the item is maximum?

Planning Models

Max

S.T.

Greedy algorithm (GA)

1, according to the value of the density from large to small into the package until the place, set at this time to put a s items

2. Compare the value obtained with the maximum value () and take the maximum output

The greedy algorithm and the optimal Solution competition ratio (approximate ratio) are

Prove:

Knapsack problem knapsack problem greedy algorithm GA