Description: 0-1 knapsack problem: Given n types of items and a backpack, the weight of item i is Wi, the value of goods i Vi, backpack with a capacity of C. How to choose the items into the bag, making the backpack into the largest total value of goods? In the selection of the articles into the bag, the only two choices for each item i, that is loaded or not loaded backpack as a backpack 0. Items backpack i can not load times, can not just load some of the items i. The main features of the 0-1 knapsack problem is to choose items i loaded backpack, only one of each item, you can select the place or hold
To Search:
File list (Check if you may need any files):
beibao\b.h
beibao
Download