搜索资源列表
01BEIBAOdongtai
- 0-1背包问题的动态规划算法C语言实现.Windows系统下 Wintc环境编写-0-1 knapsack problem of the dynamic programming algorithm C language. Windows systems Wintc Central Habitat prepared
OI
- 用多种算法解决0－1背包问题，包括回朔法，动态规划，贪心算法等-algorithm used to solve a variety of 0-1 knapsack problem, including the retrospective method, dynamic programming, greedy algorithm
benchmark+for+DP
- 旅行商问题动态规划算法的应用 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。 -TSP dynamic programming algorithm of a salesman to a number of cities to sell commodities, known the distance between ci
0-1Pack
- 用C#写的《计算机软件算法分析与设计》的作业--动态规划算法，0-1背包问题 可选择背包容量（浮点型）和指定每个物品的重量（浮点型），生成物品选择表和统计信息
suanfashejiyufenxi
- 这是计算机常用算法及其分析，算法如动态规划，贪心算法，分治算法，分支定界算法等。-This is a commonly used computer algorithms and analysis, algorithms such as dynamic programming, greedy algorithm, sub-rule algorithm, branch and bound algorithm.
short_path
- 四种算法求最短路径的例子，C#，图形演示 分别为贪心发，动态规划发，分支限界法，和回溯法-Four shortest path algorithm for example, C#, Graphical presentations were greedy fat, fat, dynamic programming, branch and bound method, and backtracking
Arithmetic
- 包含Dijkstra、Floyd、kruskal、动态规划、随机数生成等MATLAB程序-Contains Dijkstra, Floyd, kruskal, dynamic programming, random number generator, such as MATLAB program
s1
- 动态规划算法，包括算法的演示和说明，附效果图-Dynamic programming algorithm, including a demonstration and descr iption of algorithm, with the effect of map
dongtaiguihua
- Matlab源程序用动态规划方法求最短路径。-Matlab source code using dynamic programming method for the shortest path.
LongestOrderedSubsequence
- 本问题是计算最长有序子序列的一个动态规划算法,效率为31MS.-The problem is calculating the longest in an orderly sequence of a dynamic programming algorithm, the efficiency for the 31MS.
dynamic-programming-papers
- 介绍动态规划算法方面的论文: 动态规划的深入探讨/基本动态规划问题的扩展-Introduction of dynamic programming algorithm for papers: Dynamic Programming-depth study/basic dynamic programming problem of the expansion of
1027
- zoj 的1027题。 采用动态规划求解。 -zoj the 1027 title. The use of dynamic programming to solve.
ld
- 对任给的两个字符串A，B，用动态规划算法算出他们的最小编辑距离-For any given two strings A, B, using dynamic programming algorithm to calculate the minimum edit distance
LCS
- 最大公共子序列，利用动态规划实现 just enjoy it-The largest common sub-sequences, the use of dynamic programming realize just enjoy it
guihua
- 算法设计分析，动态规划，与背包问题类似的最优化求解问题-Algorithm design and analysis, dynamic programming, knapsack problem with a similar optimization problem solving
TSP_22222
- 旅行商问题_数组实现 请设计出一个动态规划算法 程序设计 任给一个输入实例，能输出最短路程及其路线 能用图形演示旅行商的推销路线-Traveling Salesman Problem _ array to achieve, please design a dynamic programming algorithm to a program design any input example, can output th
maxsubsum
- 几种经典算法实现最大字段和问题（分治算法，动态规划算法）-Several classical algorithm for maximum field and problems (sub-rule algorithm, dynamic programming algorithm)
TangleJAVA
- 数字三角形问题,使用动态规划算法解决问题,包含输入输出文件 -The number of triangles, the use of dynamic programming algorithm to solve the problem, including input and output documents
TSP
- 本程序利用动态规划的思想实现了经典的旅行商问题，程序中考虑为5个城市的情况。-This procedure using the idea of dynamic programming to achieve the classic traveling salesman problem, procedures to consider for the five cities.
dongtaiguihua
- 动态规划解一系列经典问题，包含多个不同算法哦-Dynamic programming solution of a series of classical problems, including a number of different algorithms Oh