Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Optimization pp 3507–3519Cite as

Shortest Path Tree Algorithms

SPT

  • Reference work entry

  • 313 Accesses

Article Outline

Keywords

Mathematical Model

A Generic Shortest Path Algorithm

Implementations of the Generic Algorithm

  Label Setting Methods

  S-HEAP

  S-DIAL

  Label Correcting Methods

  Bellman–Ford Method

  D'Esopo–Pape Method

Auction Algorithms

  Graph Reduction in Auction Algorithms

  Modified Version of the Standard Auction Algorithm

  Graph Collapsing In Auction Algorithms

  Graph Collapsing Auction Algorithm

  Virtual Source Concept Applied in Auction Algorithms

A New Virtual Source Algorithm

Computational Results

Conclusions

See also

References

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: Theory, algorithms and applications. Prentice-Hall, Englewood Cliffs, NJ

    Google Scholar 

  2. Becker A, Geiger D (1996) Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem. Artif Intell 83:167–188

    Article  MathSciNet  Google Scholar 

  3. Bellman R (1957) Dynamic programming. Princeton Univ. Press, Princeton

    MATH  Google Scholar 

  4. Bertsekas D (1979) A distributed algorithm for the assignment problem. Working Paper Lab. Inform. and Decision Syst. MIT

    Google Scholar 

  5. Bertsekas D (1985) A distributed asynchronous relaxation algorithm for the Assignment Problem. In: 24th IEEE Conf. Decision and Control, Ft. Lauderdale, FL, pp 1703–1704

    Google Scholar 

  6. Bertsekas D (1988) The auction algorithm: A distributed relaxation method for the assignment problems. Ann Oper Res 14:105–123

    Article  MathSciNet  MATH  Google Scholar 

  7. Bertsekas D (1991) The auction algorithm for shortest paths. SIAM J Optim 1:425–447

    Article  MathSciNet  MATH  Google Scholar 

  8. Bertsekas D (1991) Linear networks optimization: Algorithms and codes. MIT, Cambridge, MA

    Google Scholar 

  9. Bertsekas DP (1998) Network optimization: Continuous and discrete models. Athena Sci., Belmont, MA

    MATH  Google Scholar 

  10. Bertsekas D, Castanon DA (1989) The auction algorithm for minimum cost network flow problem. Report Lab. Information and Decision Systems MIT P-1925

    Google Scholar 

  11. Bertsekas D, Castanon DA (1989) The auction algorithm for transportation problems. Ann Oper Res 20:67–96

    Article  MathSciNet  MATH  Google Scholar 

  12. Bertsekas D, Castanon DA (1991) A generic auction algorithm for the minimum cost network flow problem. Report Lab. For Information and Decision Systems MIT P-2084

    Google Scholar 

  13. Bertsekas D, Pallottino S, Scutellá MG (1995) Polynomial auction algorithms for shortest paths. Comput Optim Appl 4:99–125

    Article  MathSciNet  MATH  Google Scholar 

  14. Cerulli R, Festa P, Raiconi G (1997) An efficient auction algorithm for the shortest path problem using virtual source concept. Techn. Report D.I.A.R.M. Capocelli Univ. Salerno 7

    Google Scholar 

  15. Cerulli R, Festa P, Raiconi G (2000) Graph collapsing in auction algorithms. Techn. Report D.I.A.R.M. Capocelli Univ. Salerno 6/97, to appear in: Computational Optimization and Application

    Google Scholar 

  16. Cerulli R, Leone R De, Piacente G (1994) A modified auction algorithm for the shortest path problem. Optim Methods Softw 4:209–224

    Article  Google Scholar 

  17. Chernassky BV, Goldberg AV, Radzik T (1996) Shortest path algorithms: Theory and experimental evaluation. Math Program 73:129–174

    Google Scholar 

  18. Cormen TH, Leiserson CE, Rivest RL (1990) Introduction to algorithms. MIT, Cambridge, MA

    MATH  Google Scholar 

  19. Dial RB (1969) Algorithm 360: Shortest path forest with topological ordering. Comm ACM 12:632–633

    Article  Google Scholar 

  20. Dijkstra E (1959) A note on two problems in connexion with graphs. Numer Math 1:269–271

    Article  MathSciNet  MATH  Google Scholar 

  21. Festa P, Cerulli R, Raiconi G (1999) Complexity and experimental evaluation of primal-dual shortest path tree algorithms. In: Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems. Kluwer, Dordrecht

    Google Scholar 

  22. Ford LR Jr (1956) Network flow theory. Report The Rand Corp. P-923

    Google Scholar 

  23. Gallo G, Pallottino S (1986) Shortest path methods: A unified approach. Math Program Stud 26:38–64

    MathSciNet  MATH  Google Scholar 

  24. Gallo G, Pallottino S (1988) Shortest path methods. Ann Oper Res 13:3–79

    Article  MathSciNet  Google Scholar 

  25. Gallo G, Pallottino S, Ruggeri C, Storchi G (1984) Metodi ed algoritmi per la determinazione di cammini minimi. Monografie di Software Mat. 29

    Google Scholar 

  26. Klingman D, Napier A, Stutz J (1974) NETGEN - A program for generating large scale (un) capacitated assignment, transportation, and minimum cost flow network problems. Managem Sci 20:814–822

    MathSciNet  MATH  Google Scholar 

  27. Pallottino S, Scutellá MG (1991) Strongly polynomial auction algorithms for shortest path. Ricerca Oper 21:60–60

    Google Scholar 

  28. Papadimitriou CH, Steiglitz K (1982) Combinatorial optimization: Algorithms and complexity. Prentice-Hall, Englewood Cliffs, NJ

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dip. Mat. e Inform., Universitá Salerno, Baronissi, Italy

    Paola Festa

Authors
  1. Paola Festa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Festa, P. (2008). Shortest Path Tree Algorithms . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_605

Download citation

Publish with us

Policies and ethics

Search

Navigation