Description: Given n types of items and a backpack. Item i is the weight wi, the value of vi, backpack capacity of c. Asked how to choose the items into the backpack, backpack into making the total value of the largest items. In the choice of loading backpack items, for each item i have only two choices, that is not loaded into a backpack or bag. Items into the backpack i can not be repeated, and not only into some of the items i. Therefore, the problem is called 0-1 knapsack problem.
To Search:
File list (Check if you may need any files):
LV 和backtrack求解01背包问题件\data.txt
..............................\Las vegas 和backtrack求解01背包问题.doc
..............................\LasBacktrack.cpp
LV 和backtrack求解01背包问题件
Download