Description: Enter the number of items and backpacks the size of the load procedure automatically for each of the weight and value of items given a random value (range 10 ~ 80), output load backpack items the total value of the largest and at this time the total value of goods大小. Realize Methods: 1 backtracking, 2 FIFO Branch and Bound, 3 LC Branch-and-Bound
To Search:
- [TSP(C).Rar] - genetic algorithm to solve TSP C source
- [01packet] - 4 ways to write 01 backpack algorithm pr
- [changecursor] - Dynamic change cursor, can set different
- [av] - Provides an avi control for the purpose
- [01beibaozhenghechengxu] - Knapsack problem is very useful package
- [beibao] - Retrospective method with 0-1 knapsack p
File list (Check if you may need any files):
Download