Description: 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.)
To Search:
File list (Check if you may need any files):
knapsack problem UC.txt
Download