Handbook of Optimization in Telecommunications M.G.C. Resende and P.M. Pardalos (Editors) Springer Science + Business Media, 2006.
Chapter 8
Shortest path algorithms
P. Festa
Abstract
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.
Keywords: Shortest path problem, network flow problems, network optimization, combinatorial optimization.