摘要
阐述动态规划法的基本原理及其求解方法、求解步骤,分析动态规划法在生产生活中的应用,列举了用动态规划法求解多段图的最短路径问题、资源分配问题和0-1背包问题。通过对不同实例的求解,分析动态规划法的不同计算思路,从而总结出动态规划法的优点。
This paper describes the basic principle of dynamic programming method,the method and procedure for solving,and analyses the application of dynamic programming method in production and life.How to use the dynamic programming method to solve the problems of shortest path,resource allocation and 0-1 Knapsack are enumerated.By solving different examples,the different calculation ideas of dynamic programming method are analyses,and the advantages are summarized.
作者
李小莲
Li Xiaolian(Guangdong Polytechnic College,Zhaoqing,Guangdong 526100,China)
出处
《计算机时代》
2019年第6期53-55,共3页
Computer Era
基金
2018年广东省本科高校教学质量与教学改革工程建设项目“以专业评估与专业认证为抓手推动计算机类专业内涵建设和发展”(项目编号:661)
关键词
动态规划
最短路径
资源分配
0-1背包
dynamic programming
shortest path
resource allocation
0-1 Knapsack
