Description: 0/1 knapsack problem, the need for the capacity of the c loaded backpack. N items from the selected load backpack items, each of the items i weight of wi, the value of pi. For a viable backpack loaded backpack with a total weight of the backpack should not exceed capacity, loading is the best means by loading the maximum value of goods that sigma pi* xi obtain maximum.
To Search:
File list (Check if you may need any files):