Description: 01 knapsack problem problem statement: given n kinds of items, and a backpack, the weight of the items i wi, the value of vi, backpack capacity C. Reasonable choice items into a backpack, making the total value of the items loaded backpack. Each item i select items loaded backpack, there are only two choices that loaded backpack or loaded backpack. Items i can not be loaded into a backpack many times not only loaded items i. The problem analysis: 01 knapsack problem is a selected subset of the problem and suitable for the tree represents a subset of the solution space of 01 knapsack problem. Search solution space tree, as long as its left son node is a feasible node, the search into the left subtree, right subtree may contain only into the right subtree search the optimal solution Otherwise, the right subtree cut.
To Search:
File list (Check if you may need any files):
12 01背包问题(回溯算法)\0 1背包问题(回溯算法) 实验报告.doc
.......................\0 1背包问题(回溯算法).cpp
.......................\0 1背包问题(回溯算法).exe
.......................\0 1背包问题(回溯算法).o
12 01背包问题(回溯算法)
Download