Description: 0/1 knapsack problem: given n types of items and a knapsack of capacity C, the weight of item i is wi, the value of vi, 0/1 knapsack problem is how to choose a backpack load of goods (goods indivisible), items into the backpack making the total value of the largest? backtracking to solve 0/1 knapsack problem
To Search:
- [beibao] - 0_1 knapsack problem, backtracking the b
- [yy] - Seeking with branch and bound algorithm
- [Desktop] - Experiment 4: Design and Implementation
File list (Check if you may need any files):
回溯法解决0-1背包问题.cpp
Download