搜索资源列表
dp
- (1).问题描述：旅行商问题 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要 选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（ 或旅费）最小。 (2).程序设计要求： a. 设计一个动态规划算法 b. 任给一个输入实例，能输出最短路程及其路线 c. 能用图形演示旅行商的推销路线 输入要测试的文件名，如TSP6.txt,程序将利用动
longest-common-string
- 这是动态规划中，求最长公共子序列（Longest common string）的源代码。自己编写执行。程序简单，有注释。-This is a dynamic planning, seeking the longest common sub-sequence (Longest common string) the source code. The preparation of the implementation of their own
sf
- 算法设计有贪心法，回溯法，动态规划等 算法设计有贪心法，回溯法，动态规划等-Algorithm design are greedy method, backtracking, dynamic programming algorithm design, such as greedy method, backtracking, dynamic programming, etc.
floyd
- 图论中求解不含负权环的多源动态规划算法floyd-Graph theory for solving non-negative right ring dynamic programming algorithm for multi-source floyd
barge
- 船舶运货算法问题，依据算法程序设计与分析中的经典算法，进行动态规划，找出最佳路径-Shipping Freight algorithm problem, according to algorithm design and analysis procedure of the classical algorithm, dynamic planning, identifying the best path
15
- 算法思想，详细介绍了动态规划算法的应用场合及使用方式-Algorithm ideas, described in detail the application of dynamic programming algorithm and use occasions
traceback
- 这是用matlab编写的有关动态规划算法中回溯的实现，是串匹配时用的-This is prepared using matlab on the dynamic programming algorithm realize the back is used when string matching
DP
- 这是一个用动态规划算法，来解决流水作业问题的C程序。-This is a dynamic programming algorithm used to solve the problem of assembly-line C program.
Algorithms_Design_Techniques_an_Analysis
- 《算法设计技巧与分析》[沙特]阿苏外耶（Alsuwaiyel,M.H.）著，本书提供大量实例，从算法设计和算法分析的基本概念和方法入手，介绍了递归技术、分治、动态规划，及概率算法等。
algorithmDesignPPT
- 算法设计与文件的整套电子教案，主要包括递归和分治方法、动态规划算法、贪心算法、回溯法、分支限界法等常用算法和NP问题-Algorithm design and documentation package of electronic lesson plans, including recursive and sub-rule method, dynamic programming algorithm, greedy algorithms,
dp_tsp
- TSP问题的动态规划求解。问题描述：旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -TSP dynamic programming to solve the problem. Descr iptio
0-1beibao
- 0-1背包问题的解决，此算法基于动态规划来实现，通用性好-0-1 knapsack problem, this algorithm is based on dynamic programming to achieve, common good
Algorithm_Design
- 算法设计与分析，其中包括贪婪算法、分而治之算法、动态规划、回溯、分枝定界-Algorithm design and analysis, including greedy algorithms, divide and conquer algorithms, dynamic programming, backtracking, branch and bound
DP
- ACM.. 动态规划讲义从入门到精通，动态规划在程设中是很重要的一种算法 -ACM .. dynamic programming handouts from entry to proficient, dynamic programming in the way set up is very important in an algorithm
KnapsackProblem
- 背包问题是一个经典的动态规划模型。它既简单形象容易理解，又在某种程度上能够揭示动态规划的本质-Knapsack problem is a classic dynamic programming model. It is simple and easy to understand images, but also to some extent, able to reveal the essence of dynamic programmi
poj_report
- acm 题目分析 经典动态规划题目详细解体报告-acm subject analysis of classical dynamic programming topic in detail the disintegration of the report
map
- 关于旅行商问题的动态规划算法 在vc环境下编译通过-On the traveling salesman problem dynamic programming algorithm in vc compiler environment through
tsp
- 利用动态规划算法 vc实现的小规模旅行商问题-Vc algorithm using dynamic programming to achieve small-scale traveling salesman problem
C++2
- 动态规划下的最优子序列问题，用文件的方式加以实现-Under the optimal dynamic programming sequence problem, with papers to realize
MinForeDynprog
- MinForeDynprog.rar是基于MATLAB的动态规划算法的源程序！-MinForeDynprog.rar is based on the dynamic programming algorithm MATLAB source!