| 破圈法解动态规划中的最短路问题 |
| |
| 引用本文： | 周迎.破圈法解动态规划中的最短路问题[J].西昌学院学报(自然科学版),2003(3). |
| |
| 作者姓名： | 周迎 |
| |
| 作者单位： | 西昌市二中 四川西昌 |
| |
| 摘 要： | 运筹学动态规划多阶段决策中的最短路问题有多种解法。把求最小树的破圈法扩展用于有向图中解最短路问题,较之常用的Dijkstra方法更直现快捷。
|
| 关 键 词： | 动态规划 多阶段决策 最短路 破圈法 |
Circle Analysis: Solution to the Shortest Cut in Dynamic Planning |
| |
| ZHOU Ying.Circle Analysis: Solution to the Shortest Cut in Dynamic Planning[J].Journal of Xichang College,2003(3). |
| |
| Authors: | ZHOU Ying |
| |
| Abstract: | There are numerous solutions to the shortest way problem in dynamic planning multi-stage decision-making. Applying the circle-analysis method of the smallest tree to finding out the shortest way in directional graphs is a much more efficient way than the much-used Dijkstra method. |
| |
| Keywords: | Dynamic Planning Multi-stage Decision-making Shortest Way Circle- Analysis |
| 本文献已被 CNKI 等数据库收录！ |
