| 动态规划中最短路问题的计算机解法 |
| |
| 引用本文： | 朱廷昌,王志学.动态规划中最短路问题的计算机解法[J].吉林工学院学报,1986(2). |
| |
| 作者姓名： | 朱廷昌 王志学 |
| |
| 作者单位： | 吉林工学院管理工程系
(朱廷昌)，吉林工学院管理工程系(王志学) |
| |
| 摘 要： | 动态规划的任务就是要找出一个网络的最短路线,据此做出最优决策。本文阐述了解法的原理并介绍了根据顺序解法用BASIC语言编写了计算机程序。这些计算机程序可提供准确结果,省力又省时。
|
| 关 键 词： | 动态规划 最短路问题 决策 |
A Computer Solution of the Shortest Path Problem in the Dynamic Programming |
| |
| Zhu Tingchang Wang Zhixue,The Management Engineering.A Computer Solution of the Shortest Path Problem in the Dynamic Programming[J].Journal of Jilin Institute of Technology,1986(2). |
| |
| Authors: | Zhu Tingchang Wang Zhixue The Management Engineering |
| |
| Institution: | Zhu Tingchang Wang Zhixue
The Management Engineering Department |
| |
| Abstract: | The task of the dynamic programming is to find out the solution of the shortest path of the network .Then an optimum decision according to the solution could be made.In this article, the principle of the solution is expounded.A BASIC computer program based on the method of the sequence solution is introduced and can offer accurate solution, save manpower and time. |
| |
| Keywords: | dynamic programming the shortest path problem dicision |
| 本文献已被 CNKI 等数据库收录！ |
