knapsack-problem-UC
代码说明:
0-1背包问题解决机组组合问题(给定N中物品和一个背包。物品i的重量是Wi,其价值位Vi ,背包的容量为C。问应该如何选择装入背包的物品,使得转入背包的物品的总价值为最大?? 在选择物品的时候,对每种物品i只有两种选择,即装入背包或不装入背包。不能讲物品i装入多次,也不能只装入物品的一部分。因此,该问题被称为0-1背包问题。 )(0-1 knapsack problem solving unit commitment problem (in a given N items and a backpack. Weight of the items i is Wi, the value of bit Vi, knapsack capacity C. Ask how to choose the items into the backpack, making the turn The total value of goods for the biggest backpack?? when selecting items for each item i have only two choices, that is loaded or not loaded backpack backpack. items i can not speak loading times, can not just load part of the article, so the problem is called 0-1 knapsack problem.))
文件列表:
knapsack problem UC.txt,2742,2014-05-16
下载说明:请别用迅雷下载,失败请重下,重下不扣分!