搜索资源列表
BinPacking
- 这是最难的一个程序了，算法是运筹学里的branch band的集装箱问题的最优动态规划解法，当年我的头都大了才实现的，绝得数学加实践的程序-this is the most difficult of a process, the algorithm is tacticians band's branch of the container optimal dynamic programming solution, for the first time, I have to get bigg
Ackermannand
- 自己编写的几个动态规划算法的例子，供正在学习算法的人参考-their preparation of several dynamic programming algorithm for example, is learning algorithm for the reference
zn
- 用C语言写的多段图算法的实现,多段图是动态规划的一个典型的实例.-C language in many of the map algorithm to achieve more of the map is a dynamic planning a typical example.
duixiang
- 这是动态规划中的经典算法。多段图的向前向后的处理算法的VC++环境种的实现代码-This is the dynamic programming of the classical algorithm. Many of the plans forward backward processing algorithm for the VC types of codes
mySuanfa
- 里面包含vc的经典算法,如动态规划,分治,回溯,贪心算法等-contained vc classic algorithms, such as dynamic planning, administration, backtracking, greedy algorithm
0-1
- 算法设计与分析：动态规划解决0-1背包问题
最长公共子序列
- 动态规划算法中的最长公共子序列算法-dynamic programming algorithm for the longest sequence of public Algorithm
0-1beibao
- 0-1背包问题的解决，此算法基于动态规划来实现，通用性好
map
- 关于旅行商问题的动态规划算法 在vc环境下编译通过