Description: computer algorithm famous 0_1 knapsack problem : given n product and a backpack. I articles of the weight of Wi, the value of Vi and backpack is the capacity c, asked how to choose a backpack loaded the items, make backpack loaded with a total value of the largest.
File list (Check if you may need any files):
Download