Shortest Path Algorithms

Paola Festa ()
Additional contact information
Paola Festa: University of Naples FEDERICO II, Mathematics and Applications Department

Chapter 8 in Handbook of Optimization in Telecommunications, 2006, pp 185-210 from Springer

Abstract: 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 (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-387-30165-5_8

Ordering information: This item can be ordered from
http://www.springer.com/9780387301655

DOI: 10.1007/978-0-387-30165-5_8

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().