Shortest path algorithms

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 monography is to provide an extensive treatment of shortest path algorithms covering both classical and recently proposed approaches