详解0-1背包问题（Detail 0-1 knapsack problem）.docVIP

详解0-1背包问题（Detail 0-1 knapsack problem） The 0-1 knapsack problem can be seen as looking for a sequence. The judgment of any variable is decided whether to be equal to 1 or = 0. After the judgment is completed, there are two situations in the judgment: (1) the backpack capacity is not sufficient to load the item I, then = 0, the value of the pack does not increase; (2) the capacity of a backpack can be loaded with an item I, which is equal to 1, and the value of the backpack increases. The largest of the total value of the backpack in both cases should be the value of the judgment. The total value of the items that can be loaded into j in the previous I item can be obtained as follows: Type (1) description: put in front of a goods loading capacity of 0 backpacks and loading capacity of j to zero items backpack, the value is 0. Type (2) the first formula: if the ith a item is greater than the weight of the backpack capacity and, in the case of a item I get maximum value and the load of the first I - 1 item to get the maximum value is the same, namely items I cannot load in the backpack; Second formula: if the ith a item weight less than the capacity of a backpack, then there will be two things: (1) if the items into the backpack, I will pack the items value is equal to the former I - 1 item in the load capacity of the knapsack value plus the value of the ith a items; (2) if the ith item does not load into a backpack, the value of the item in the backpack is equal to the value of the previous i-1 item loaded into the bag of j. Obviously, the best solution in the bag of the former I was to be loaded into j. We can solve it step by step. The first step is to load the first item only and determine the maximum value of the backpack in all circumstances. Step 2: only load the first two items and determine the maximum value of a backpack in various situations. So once we go to the NTH step, we get the optimal solution that we need. Finally, the maximum value of loading n obje