| Kth最短路径的Bellman改进算法 |
| |
| 引用本文： | 李杰,刘思峰,任盈盈,贾迎宾,商红岩.Kth最短路径的Bellman改进算法[J].数学的实践与认识,2006,36(1):215-219. |
| |
| 作者姓名： | 李杰 刘思峰 任盈盈 贾迎宾 商红岩 |
| |
| 作者单位： | 南京航空航天大学经济与管理学院,南京,210016 |
| |
| 摘 要： | 基于对Bellm an算法的改进,得到了求解k th最短路的新算法.改进算法的优势在于从Bellm an算法只能解决最短路问题拓展到求解k th最短路问题,而且可以考虑权重为负数的情况.与传统算法相比,新算法更易于理解.
|
| 关 键 词： | kth最短路 最短路径 次短路径 路径追踪 |
| 修稿时间： | 2005年9月28日 |
An Improved Bellman Algorithm for the Kth-shortest Path Problem |
| |
| LI Jie,LIU Si-feng,REN Ying-ying,JIA Ying-bin,SHANG Hong-yan.An Improved Bellman Algorithm for the Kth-shortest Path Problem[J].Mathematics in Practice and Theory,2006,36(1):215-219. |
| |
| Authors: | LI Jie LIU Si-feng REN Ying-ying JIA Ying-bin SHANG Hong-yan |
| |
| Abstract: | Based on the Bellman algorithm,we make an improvement to get a new algorithm of solving the kth shortest path problem.The advantage of this method is expanding the coverage of Bellman algorithm from solving the shortest path to the kth-shortest path,and taking the minus weight value into account.Furthermore,the new algorithm itself is not far to seek,comparing with the traditional one. |
| |
| Keywords: | kth-shortest path Shortest path 2~(nd)-shortest path Path tracing |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
