搜索资源列表
shortestPath
- 在visual C++上写的动态规划算法在图论中旅行商问题上的应用，适合算法分析的朋友。-In visual C++ to write the dynamic programming algorithm to find the shortest path in the graph the application of suitable algorithms friends.
dongtaiguihua
- 用动态规划实现最短路径问题 请大家指教-Achieve the shortest path dynamic programming problem
dynamicprogramming
- 算法分析中的实例，利用递归的思想解决动态规划问题-Examples of algorithm analysis, recursive thinking to solve the problem of dynamic programming
dynamic
- 动态规划算法 程序设计大赛必备 最优化原理 重复子问题-Dynamic Programming Algorithm Programming Contest necessary to repeat the principle of sub-optimization problem
knapsack
- 0-1背包问题，典型的动态规划问题的实现过程-0-1 knapsack problem, a typical dynamic programming problem of the realization of the process! ! !
TSP_by_dynamic_programming
- 使用C++ 实现的，利用动态规划算解决旅行商问题-solving TSP problem with dynamic programming in C++
matrix_mult
- 关于矩阵连乘的问题，用动态规划的算法思想进行的实现！-matrix_mult
zuiduan
- 这是最短路径动态规划问题及其程序设计，大家可以参考-hao
optimal_scheduling_independent_tasks
- Visual studio 2005开发环境下 算法课程实验 用动态规划方法解决独立任务最优调度问题-Visual studio 2005 development environment,with a dynamic programming method,in algorithm course experiment, to solve the optimal scheduling independent tasks problem
TSP动态规划
- TSP问题(担货郎问题)的动态规划算法实现(Dynamic programming implementation of TSP problem)
c++实现0-1背包问题
- 用C++工具，使用动态规划算法实现0-1背包问题,(implementation of the 0-1 knapsack problem with C++)
动态规划合集
- 与动态规划问题相关的内容讲解，包括背包问题等等(Related to dynamic programming issues, including knapsack problems and so on)
王敬贤-SA16168143-第3次作业
- 关于两个字符串s1,s2的差别，可以通过计算他们的最小编辑距离来决定。用C++设计动态规划算法解决此类问题(The difference between the two strings s1, s2, can be determined by calculating their minimum edit distance.Using c + + design dynamic programming algorithm to solve these problems)
动态规划
- -动态规划(Dynamic Programming,简称DP),虽然抽象后进行求解的思路并不复杂,但具体的形式千差万别,找出问题的子结构以及通过子结构重新构造最优解的过程很难统一,(Dynamic programming (Dynamic Programming, referred to as DP), although the abstract is solved after thinking is not complicated, but the specific form of diffe
动态规划
- 背包问题的动态规划程序，只是简单实现，有什么问题可以和我交流讨论。(Knapsack problem dynamic planning process, just a simple realization, what issues can be discussed with me.)
动态规划
- 动态规划问题1234567890111223(Dynamic programming problem1234567890111223)
背包问题动态规划详解
- 0/1背包问题动态规划详解及C代码 动态规划是用空间换时间的一种方法的抽象。(0/1 knapsack problem dynamic programming detailed and C code Dynamic programming is the abstraction of a method of replacing time with space.)
动态规划求解0-1背包问题
- 通过动态规划的算法得到装进背包的最大价值(The maximum value of knapsack is obtained by dynamic programming algorithm.)
dynamic programming
- 处理运筹学中的动态规划问题，文件中dynprog.m是主要函数，动态规划的主要过程均在其中进行，其余四个函数定义一些简单的过程，以简化主函数编写(dynamic programming(matlab))
招聘问题
- 使用动态规划解决一定预算下，每个岗位找一个人的招聘问题(Use dynamic programming to solve the recruitment problem of finding a person in each post under certain budget.)