Shortest path algorithms
Shortest path algorithms
复制标题
DOI：
10.1007/978-0-387-30165-5_8
复制
发表时间：
1988-12
影响因子：
4.8
通讯作者：
Paola Festa
中科院分区：
文献类型：
--
作者：
Paola Festa
最短路径问题是在许多情况下出现的基本网络优化问题，具有广泛的应用，包括动态规划、项目管理、背包问题、数据网络中的路由和运输问题。本章的范围是提供对最短路径算法的广泛处理，涵盖经典方法和最近提出的方法。
Shortest path problems are fundamental network optimization problems arising in many contexts and having a wide range of applications, including dynamic programming, project management, knapsack problems, routing in data networks, and transportation problems. The scope of this chapter is to provide an extensive treatment of shortest path algorithms covering both classical and recently proposed approaches.