搜索资源列表
WorkAssignment
- 算法设计与分析中，用回溯法解决工作分配问题，有较详细的源码解析。-Algorithm design and analysis, the distribution of work by backtracking to solve the problem, there is a more detailed source code analysis.
01bag
- 用蛮力法，回溯法，分支限界法求解背包问题-With the brute force method, backtracking, branch and bound method for solving knapsack problem
heshangtiaoshui
- 和尚挑水问题（文件内有详细解释） 主要是回溯法的一个好的实例 自己摸索出来的-Monk carrying water issues (the paper has explained in detail) is primarily a good example of backtracking find their own way out of
beibaowenti
- 算法实验C++编程用回溯法解决01背包问题-Experimental C++ programming algorithm with backtracking to solve 01 backpack
bags
- 四种算法（动态规划、回溯法、分支限界法、贪心法）实现0-1背包问题-four algorithms including dynamic planningm,tracing,branch and bound method and greedy to implement 0-1 bag problem.
Desktop
- 调度问题的回溯算法，算法中的经典问题。问题描述：假设有n个任务由k个可并行工作的机器完成。完成任务i需要的时间为ti。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。-Scheduling problem backtracking algorithm is the classic problem. Problem Descr iption: Suppose there are n-task by the k-pa
CommonAlgorithmDesign
- 常用的算法设计方法集合，主要有迭代法、穷举搜索法、递推法、贪婪法、回溯法、分治法、动态规划法-Algorithm commonly used method of collection, mainly iterative, exhaustive search methods, recursion, greedy method, backtracking, divide and conquer, dynamic programming
0_1bag
- 此程序是用回溯法解决01背包问题，可以运行成功，欢迎下载-This program is backtracking to solve 01 knapsack problem, you can run successfully, please download
pack_of_four_algorithms
- 01背包四种算法实现:动态规划法,分支限定法,回溯法,贪心算法-01 pack of four algorithms: dynamic programming, branch limit method, backtracking, greedy algorithm
MyDaoYou
- 倒油，分油问题，回溯法解决 就是3个桶 12（满），8（空），5（空），怎么倒出1~12-split oil
java
- 老师给的用Java编写的算法，包括背包问题， 回溯法等等，适合有基础的学习。-Teacher' s use of algorithms written in Java, including the knapsack problem, backtracking, etc., suitable for basic learning.
Traveling
- 利用回溯法实现了旅行售货员的算法,代码为java.-Achieved by backtracking the traveling salesman algorithms.
01
- c++利用回溯法来实现01背包问题 阶段是：在前N件物品中，选取若干件物品放入背包中； 状态是：在前N件物品中，选取若干件物品放入所剩空间为W的背包中的所能获得的最大价值； 决策是：第N件物品放或者不放； -c++ using backtracking to achieve the 01 knapsack problem Stage: the first N items, select the number of it
chapter_8
- 现代智能算法法程序代码，遗传法 贪婪法 模拟退火法 蚂蚁群法 回溯法-Modern intelligent algorithms law code, the genetic method simulated annealing greedy algorithm backtracking ant colony method
c3
- 组合问题 问题描述：找出从自然数1，2，…，n中任取r个数的所有组合。 采用回溯法找问题的解，将找到的组合以从小到大顺序存于a[0]，a[1]，…，a[r-1]中，组合的元素满足以下性质： （1） a[i+1]>a，后一个数字比前一个大； （2） a-i<=n-r+1。 -Combinatorial problems Problem Descr iption: Find out from the n
最速下降法和牛顿法
- 基于回溯线搜索的最速下降法和牛顿法，配数值算例(Steepest descent method and Newton method based on backtracking line search)
Newton
- 回溯先搜索法梯度下降法与牛顿迭代算法结合的MATLAB例程(Backtracking first search method, gradient descent method and Newton iterative algorithm combined with MATLAB routines)
grad
- 梯度下降法优化函数，包括回溯搜索法和精确直线法(Gradient descent method to optimize the function, including backtracking search method and precise line method)
栈
- 从1楼到2楼有h级台阶，某同学上楼的习惯是一次上1级或2级，写一算法输出该同学上这h级台阶时的所有不同的上法，用回溯法实现，开辟堆栈保存上楼方法(From the 1 floor to the 2 floor H steps, a classmate upstairs is a habit of 1 or 2, write an algorithm to the output of the students on the H level
最大数乘积
- 一个大数，通过添加断点可以将其分为若干个小数，而这几个小数的乘积最大是多少呢？本程序可以通过回溯法求解这个最大数乘积。(A large number, by adding breakpoints can be divided into a number of decimal and decimal the largest product is how much? This procedure can be the product of