在0 / 1背包问题中，需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高，即Σpi*xi 取得最大值。-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.