搜索资源列表
knapsack
- 0—1背包问题的五种解法 1贪心法 2动态规划 3回溯 4分支限界 5遗传算法-0-1 knapsack problem greedy algorithm five Solution 1 2 3 back in 4 dynamic programming genetic algorithm branch and bound 5
TSP
- 本程序通过使用分支限界法实现旅行商问题，成功解决了旅行商问题-This procedure achieved by using the branch and bound traveling salesman problem, successfully solved the traveling salesman problem
wrewwererw
- 分支限界法解决——TSP问题的讲述，及其算法（是PPT）-Branch and bound method to solve- TSP problem about its algorithm (which is PPT)
algorithm_report
- 算法设计报告5个重要算法，包括贪心，回溯，动态规划，分支限界，分治法-Algorithm design report five algorithms, including greedy, backtracking, dynamic programming, branch and bound, divide and conquer
1683387
- 求解货郎担问题的分枝限界算法,程序中有较为详细的注释()