摘要
动态规划是解决最优化问题的基本方法,文中介绍了动态规划的数学依据、基本思想,给出 了利用动态规划思想进行算法设计的一般策略及其在算法设计中一些应用。
Dynamic programming is the basic method for optimization problem solving. This paper presents the mathematical foundation and the basic ideas of dynamic programming. The general strategy of algorithm design and some application cases of dy -namic programming was also showed in this paper.
出处
《安徽电子信息职业技术学院学报》
2004年第2期69-71,共3页
Journal of Anhui Vocational College of Electronics & Information Technology
关键词
动态规划
算法设计
多阶段决策
最优化原理
最短路径
dynamic programming
algorithm design
multi - stages decision
principle of optimality
shortest path.
