搜索资源列表
computerdisign-C
- 算法的设计方法(C程序):一、迭代法 二、穷举搜索法三、递推法 四、递归五、回溯法 六、贪婪法 -algorithm design method (C program) : 1, 2 iteration, the exhaustive search method three, four recursive method, recursive 5, backtracking 6, greedy algorithm
test
- 这是一个运用回溯法解决关于\"最佳切割问题\"的程序.\"最佳切割问题\"是指给定一个宽已知的木板,有众多零件,如何拼接才能最小程度的耗费木板,也就是说使所需木板的高度最小.这一问题在许多实际应用中需要考虑到,是一个值得重视的问题!
回溯法解皇后问题
- 数值分析课程中，关于简单二分法求方程实根的用C编的程序
EghitQueue
- 八皇后问题的LasVegas与回溯法的混合算法实现，其中代码和文档详细-The eight queens problem LasVegas backtracking hybrid algorithm in detail, including code and documentation
016huisufa
- 这是ACM的讲解资料，回溯法，希望对大家有帮助。-This is the ACM
Backtracking
- 回溯法，对于ACM初学者是十分有价值内部资料-Backtracking for beginners ACM is a very valuable internal information
FenziJieding
- 分支限界法类似于回溯法，也是一种在问题的解空间树T上搜索问题解的算法-Branch and bound method is similar to retroactive law, is also a solution in the problem search space tree T on the issue of solution algorithm
4-2
- dfs回溯法解usaco 1-4-2时钟问题-dfs backtracking solution usaco 1-4-2 clock problem
Commonalgorithms
- 一些常用的算法设计方法和C++环境下的实现方法。主要包括：迭代法、穷举搜、索法、递推法、递归、回溯法、贪婪法、分治法 -Some commonly used algorithm design methods and C environments are implemented. These mainly include: iterative method, exhaustive search, rope method, recursive method, recursion, backtra
loading
- 装载问题 运用回溯法 解决双船的装载问题-Loading problems backtracking
pack_of_four_algorithms
- 01背包四种算法实现:动态规划法,分支限定法,回溯法,贪心算法-01 pack of four algorithms: dynamic programming, branch limit method, backtracking, greedy algorithm
Backtrack_0-1bag
- 从文件读入数据，用回溯法实现了0-1背包最优解的问题-Read data from a file, using backtracking to achieve the optimal solution of the 0-1 knapsack problem
Analysis_and_design_of_he_backtracking_algorithm.r
- 算法分析设计之回溯法Analysis and design of the backtracking algorithm-The backtracking algorithm analysis and design Analysis and design of the backtracking algorithm
sportsman
- 用回溯法求解最佳运动员问题，仅供新手学习使用，高手勿进！-Best Athletes by backtracking to solve the problem, only for beginners learning to use, experts do not enter!
dall
- 一个关于利用回溯法求解旅行商问题的源代码，希望对你们有帮助-A retrospective review on the use of the source code for solving traveling salesman problem, want to help you
Optimal-solution-back-to-France-0-1
- 最优解回溯法0-1问题，为了构造最优解，必须在算法中记录与当前最优值相应的当前最优解。-The optimal solution backtracking 0-1 must be recorded in the algorithm, in order to construct the optimal solution, corresponding to the current optimal value, the current optimal solution.
Algorithm-analysis-and-design
- 计算机实验室 内容： 1、分治法，maxmin算法 2、动态规划，矩阵连乘 3、贪心法， 1）背包问题，2）装载问题 4、回溯法，N皇后问题的循环结构算法和递归结构算法。-Computer laboratory content: 1, partition method, maxmin algorithm 2, the dynamic planning, LianCheng matrix 3, greedy method, 1) knapsack probl
Backtracking-batch-job-scheduling
- 运用回溯法实现批任务分配，使其工作花费最少。-The use of the backtracking implementation batch task allocation, make it work to spend at least.
huishu
- ACM入门级资料，回溯法的一些比较好的参考论文，供大家参考。-ACM entry-level information, backtracking some good reference paper for reference.
Queens
- 八皇后,回溯法,JAVA实现,1维数组,可列出所有可行解-Eight Queens, backtracking, JAVA implementation, one-dimensional arrays, lists all feasible solutions