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.

LV 和backtrack求解01背包问题件\data.txt
..............................\Las vegas 和backtrack求解01背包问题.doc
..............................\LasBacktrack.cpp
LV 和backtrack求解01背包问题件

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．