搜索资源列表
dtgh
- 是一些动态规划的经典的例程,里面还有详细的讲解-Are some of the classic dynamic programming routines, there is also a detailed explanation
dtghtsp
- 用动态规划算法求解旅行商销售员问题,给出一个耗费矩阵,能够得出最短路径长度和最短路径。-Using dynamic programming algorithm to solve traveling salesman salesman problem, given a cost matrix, able to draw the shortest path length and the shortest path.
Dynamic_Programming_A_Computational_Tool
- 英文,动态规划,非常经典的一本书,希望大家喜欢-English, dynamic programming, is a classic book, I hope everyone likes
DXTSP
- 单向的TSP旅行商问题的动态规划算法,用C语言实现。-One-way Traveling Salesman Problem TSP dynamic programming algorithm, using C language.
TSP
- 这是一个货郎担问题的动态规划代码,是C语言版的,能在TC上和VC++6.0上运行.加入了许多注释.-This is a traveling salesman problem dynamic programming code, is a C language version, can TC and VC++ 6.0 run. Adding a lot of notes.
0123
- 遗传算法在曲线多边形近似中的应用 在平面数字曲线的多边形近似中, 为克服顶点的检测只依靠局部区域、缺乏全局信息的弱点, 文中把多边 形近似问题作为寻找在满足一定的近似误差条件下使顶点数最少、或者使顶点数和近似误差都尽可能少的最优化 问题来处理. 为了能够处理点数较多的曲线, 文中采用遗传算法和基于Pareto 最优解的改进遗传算法来求近似最 优解. 和一些经典算法的实验比较表明, 文中算法与只依靠曲线局部特性的一类
beibaowenti
- 动态规划求01背包问题. 动态规划求01背包问题.-Dynamic programming for knapsack problem 01. Dynamic programming for knapsack problem 01.
dp
- 动态规划的实现程序,用于最短路径的选择!-The realization of dynamic programming procedures for the choice of the shortest path!
DF
- 问题描述 设有n种不同面值的硬币,各硬币的面值存于数组T[1:n]中。现要用这些面值的硬币来找钱,可以实用的各种面值的硬币个数不限。当只用硬币面值T[1],T[2],…,T[i]时,可找出钱数j的最少硬币个数记为C(i,j)。若只用这些硬币面值,找不出钱数j时,记C(i,j)=∞。 编程任务 设计一个动态规划算法,对1≤j≤L,计算出所有的C( n,j )。算法中只允许实用一个长度为L的数组。用L和n作
dongtai.pdf
- 这是一篇讲解动态规划的文章,动态规划,是一个很好的优化算法,但实现比较困难。文章给出了算法步骤和程序。-This is an article on dynamic programming, dynamic programming, is a good optimization algorithm, but more difficult to achieve. In this paper, the algorithm steps and
Dynprog
- 动态规划算法的顺序(前向求最小值)算法的matlab实现以及一个算例,还有一篇参考pdf文献,适合初学者,有我个人的一点注释-Dynamic programming algorithm for the sequence (prior to seeking the minimum value) algorithm matlab to achieve, as well as a numerical example, there is a r
dp
- active contour算法中的经典算法:动态规划算法文献-active contour algorithm classic algorithms: dynamic programming algorithm for literature
MatlabCodeforDeterministicDynamicProgramming
- 一个决策性动态规划的matlab代码,有参考文献,适合初学者-A dynamic programming decision-making matlab code, there are references for beginners
MatlabCodeforStochasticDynamicProgramming
- 一个实现随机动态规划的实例的matlab代码,附有参考文献,适合初学者-A realization of stochastic dynamic programming examples of matlab code, with references for beginners
DynamicProgramming
- 一个4台机器加工500个工件求最小加工时间的动态规划正向算法的例子的matlab实现-A 4-machine processing 500 Workpiece minimum processing time for dynamic programming algorithms are examples of the realization of the matlab
TSP
- tsp(旅行商问题) 利用matlab遗传算法、模拟退火算法以及lingo动态规划求解-tsp (TSP) using matlab genetic algorithms, simulated annealing algorithm and dynamic programming to solve lingo
suanfa
- 第1章 算法引论 第2章 递归与分治策略 第3章 动态规划 第4章 贪心算法 第5章 回溯法 第6章 分支限界法 -Chapter 1 Introduction Algorithm Chapter 2 Recursion and sub-rule strategy in Chapter 3 Dynamic Programming Chapter 4 greedy algorithm in Chapter 5 Ba
BagZeroOne
- java语言实现动态规划求解0-1背包问题。-java dynamic programming language for solving 0-1 knapsack problem.
guihuazuiyou
- 算法分析与设计基于动态规划的凸多边形的最优三角剖分设计报告-Algorithm Analysis and Design Based on Dynamic Programming Optimal convex polygon triangulation design report
Dynamic_pro
- 自由始端和终端的动态规划,求指标函数最小值的逆序算法递归。-The free end of the beginning and end dynamic programming, the minimum value of the reverse index function request recursive algorithm.