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

详解0-1背包问题（Detailed 0-1 knapsack problem） 0-1 knapsack problem can be regarded as looking for a sequence, the judgment of any variable is decided =1 or =0., after the judgment has been determined, and in the judgment, there will be two kinds of situations: (1) backpack capacity is not enough to load items I, then =0, backpack value does not increase; (2) the capacity of the backpack can hold items, I, =1, backpack value increases. In these two cases, the maximum value of the overall value of the backpack should be the value of the judgment. Order the total value of an item that represents a backpack of capacity J in the first I items, then the following dynamic programming function can be obtained: Type (1): I in front of a capacity of 0 items into a backpack and put 0 items into a capacity of J backpack, the value was 0. (2) first equation: if the first I items larger than the weight of the backpack capacity, the maximum value is loaded into the I items get the maximum value and the loaded I-1 items will be the same, or I cannot load the backpack; second equations: if the I goods weight is less than the capacity of backpack, then there will be two situations: (1) if the first I items into the backpack, backpack items are the value is equal to the first I-1 items into a capacity backpack and the value of the I value of the goods; (2) if the I items not loaded backpack, backpack is the value of the goods is equal to the first I-1 items into a capacity of J Backpack The value gained in. Obviously, the larger of the two is the optimal solution in the backpack that loads the first I items into a capacity J. We can work out our solution step by step. The first step, only in the first article, determined in all cases backpack can get maximum value; the second step, only in the first two items, to determine the maximum value in each case the backpack can get; once on the n step we need to get the optimal solution. Finally, the maximum value gained when loading n items in a