搜索资源列表
TravelingSalesman
- 旅行商问题的一种解法---分支限界法。输入每个城市之间的消耗，有程序给出最优解---- A Method for Solving TSP branch and bound method. Between the consumption of inputs in each city, the program gives the optimal solution with
five
- 利用分支限界法求解旅行商问题 用C++实现用分支界限法解决旅行商问题，-http://www.pudn.com/login.asp
suanfa2
- 分支限界法、分治法、动态规划法常见代码，素数环问题、背包问题、抄写书稿问题。-Branch and bound method, divide and conquer, dynamic programming method common code, prime ring problem, knapsack problem, the problem copying the manuscr ipt.
01packet
- 使用分支限界法解决01背包问题，c++代码实现，能够正确运行-Using the branch and bound method to solve the 01 knapsack problem, c++ code to run properly
suanfashiyan
- 十个算法小程序：二分法、循环赛日程算法、归并分类算法、贪心算法、背包问题、最优装载、动态规划（多段图、0-1背包、资源分配问题）、回溯和分支限界法（子集和数问题）-Ten algorithm applet: dichotomy, round robin scheduling algorithms, merge classification algorithm, greedy algorithm, knapsack problem, th
pichuli5.3
- 分支限界法解决批处理作业调度问题 算法分析与设计-Branch and bound method to solve the problem of batch job scheduling
Projects
- 分支限界法贪心算法和动态规划解决装载问题 算法分析与设计-Greedy algorithm branch and bound method and dynamic programming to solve loading problems
packing-problem
- 分别用分支搜索法和分支限界法解决装载问题，用C++实践-Search method and the branch with branch about solving problems of loading
BrandABound
- 分支限界法实现旅行商问题，C语言实现，仅供参考-Branch method to implement about traveling salesman problem
knight
- 在一个n*n的棋盘上跳马的方式走遍所有格子，用分支限界法解决。-Branch and bound method to solve the knight journey
eightnumber
- 八数码难题，又称九宫格问题，也是我们平时玩的华容道，用分支限界法解决该问题-Eight digital problem, also known as the squared problem, we usually play Huarong, branch and bound method to solve the problem
lessnumberfirst
- 八数码难题的第二种解法，仍然用分支限界法，但是选择的优先策略变成了不在目标位置上的数最少的优先的方法-The second solution of eight digital problems are still using the branch and bound, but to select the priority strategy into a not in the target location on the least nu
suanfa
- 分支限界法解决01背包问题，适用于算法上机作业-Branch and bound method to solve the 01 knapsack problem
0-1cc
- 0-1背包问题-分支限界法,算法设计课程作业-0-1 knapsack problem- branch and bound algorithm design course work
fzxj
- 分支限界法解决单源最短路径问题(xiaodan)-Branch and bound method to solve the single source shortest path problem (xiaodan)
The-algorithm-analysis-and-design
- 研究生上课所用的算法分析与设计相关文档PPT，分八个章节对算法进行详细介绍： 第1章 算法引论 第2章 递归与分治策略 第3章 动态规划 第4章 贪心算法 第5章 回溯法 第6章 分支限界法 第7章 概率算法 第8章 NP完全性理论 -Graduate classes used in algorithm analysis and design documents the PPT is divided
clique
- 最大团问题 回溯法 分支限界法 绝对给力 -the largest group huisu fenzhixianjie
shortestPath
- 用Java语言实现的用分支限界法解决单源最短路径问题的算法-An implementation of single source shortest path problem with Java language based on branch and bound method
Wiring
- 分支限界法实现布线问题，C++实现，可直接运行-A realization of wiring
solution-of-knapsack-problem
- 回溯法、分支限界法的原理，并能够按其原理编程实现解决0-1背包问题，以加深对回溯法、分支限界法的理解。 -Backtracking, branch and bound method principle, and can according to the principle of programming to realize solving knapsack problem, in order to deepen our understa