Skip to main content
SpringerLink
Log in

Plus courts chemins

  • Chapter
Optimisation combinatoire

Part of the book series: Collection IRIS ((IRIS))

  • 645 Accesses

Résumé

Un des problémes d’optimisation combinatoire parmi les plus connus est celui de la recherche d’un plus court chemin entre deux sommets donnés d’un graphe:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Références

Littérature générale

  • Ahuja, R.K., Magnanti, T.L., Orlin, J.B. [1993]: Network Flows. Prentice-Hall, Englewood Cliffs 1993, Chapters 4 and 5

    Google Scholar 

  • Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C. [2001]: Introduction to Algorithms. Second Edition. MIT Press, Cambridge 2001, Chapters 24 and 25

    MATH  Google Scholar 

  • Dreyfus, S.E. [1969]: An appraisal of some shortest path algorithms. Operations Research 17 (1969), 395–412

    Article  MATH  Google Scholar 

  • Gallo, G., Pallottino, S. [1988]: Shortest paths algorithms. Annals of Operations Research 13 (1988), 3–79

    Article  MathSciNet  Google Scholar 

  • Gondran, M., Minoux, M. [1984]: Graphs and Algorithms. Wiley, Chichester 1984, Chapter 2

    MATH  Google Scholar 

  • Lawler, E.L. [1976]: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York 1976, Chapter 3

    MATH  Google Scholar 

  • Schrijver, A. [2003]: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin 2003, Chapters 6-8

    MATH  Google Scholar 

  • Tarjan, R.E. [1983]: Data Structures and Network Algorithms. SIAM, Philadelphia 1983, Chapter 7

    Google Scholar 

Références citées

  • Ahuja, R.K., Mehlhorn, K., Orlin, J.B., Tarjan, R.E. [1990]: Faster algorithms for the shortest path problem. Journal of the ACM 37 (1990), 213–223

    Article  MATH  MathSciNet  Google Scholar 

  • Albrecht, C., Korte, B., Schietke, J., Vygen, J. [2002]: Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip. Discrete Applied Mathematics 123 (2002), 103–127

    Article  MATH  MathSciNet  Google Scholar 

  • Bazaraa, M.S., Langley, R.W. [1974]: A dual shortest path algorithm. SIAM Journal on Applied Mathematics 26 (1974), 496–501

    Article  MATH  MathSciNet  Google Scholar 

  • Bellman, R.E. [1958]: On a routing problem. Quarterly of Applied Mathematics 16 (1958), 87–90

    MATH  MathSciNet  Google Scholar 

  • Chan, T.M. [2007]: More algorithms for all-pairs shortest paths in weighted graphs. Proceedings of the 39th Annual ACM Symposium on Theory of Computing (2007), 590–598

    Google Scholar 

  • Cherkassky, B.V., Goldberg, A.V. [1999]: Negative-cycle detection algorithms. Mathematical Programming A 85 (1999), 277–311

    Article  MATH  MathSciNet  Google Scholar 

  • Dial, R.B. [1969]: Algorithm 360: shortest path forest with topological order. Communications of the ACM 12 (1969), 632–633

    Article  Google Scholar 

  • Dijkstra, E.W. [1959]: A note on two problems in connexion with graphs. Numerische Mathematik 1 (1959), 269–271

    Article  MATH  MathSciNet  Google Scholar 

  • Edmonds, J., Karp, R.M. [1972]: Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM 19 (1972), 248–264

    Article  MATH  Google Scholar 

  • Fakcharoenphol, J., Rao, S. [2006]: Planar graphs, negative weight edges, shortest paths, and near linear time. Journal of Computer and System Sciences 72 (2006), 868–889

    Article  MATH  MathSciNet  Google Scholar 

  • Floyd, R.W. [1962]: Algorithm 97 — shortest path. Communications of the ACM 5 (1962), 345

    Article  Google Scholar 

  • Ford, L.R. [1956]: Network flow theory. Paper P-923, The Rand Corporation, Santa Monica 1956

    Google Scholar 

  • Fredman, M.L., Tarjan, R.E. [1987]: Fibonacci heaps and their uses in improved network optimization problems. Journal of the ACM 34 (1987), 596–615

    Article  MathSciNet  Google Scholar 

  • Fredman, M.L., Willard, D.E. [1994]: Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences 48 (1994), 533–551

    Article  MATH  MathSciNet  Google Scholar 

  • Goldberg, A.V. [1995]: Scaling algorithms for the shortest paths problem. SIAM Journal on Computing 24 (1995), 494–504

    Article  MATH  MathSciNet  Google Scholar 

  • Henzinger, M.R., Klein, P., Rao, S., Subramanian, S. [1997]: Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences 55 (1997), 3–23

    Article  MATH  MathSciNet  Google Scholar 

  • Johnson, D.B. [1977]: Efficient algorithms for shortest paths in sparse networks. Journal of the ACM 24 (1977), 1–13

    Article  MATH  Google Scholar 

  • Johnson, D.B. [1982]: A priority queue in which initialization and queue operations take O(log log D) time. Mathematical Systems Theory 15 (1982), 295–309

    Article  MATH  Google Scholar 

  • Karp, R.M. [1978]: A characterization of the minimum cycle mean in a digraph. Discrete Mathematics 23 (1978), 309–311

    MATH  MathSciNet  Google Scholar 

  • Megiddo, N. [1979]: Combinatorial optimization with rational objective functions. Mathematics of Operations Research 4 (1979), 414–424

    Article  MATH  MathSciNet  Google Scholar 

  • Megiddo, N. [1983]: Applying parallel computation algorithms in the design of serial algorithms. Journal of the ACM 30 (1983), 852–865

    Article  MATH  MathSciNet  Google Scholar 

  • Moore, E.F. [1959]: The shortest path through a maze. Proceedings of the International Symposium on the Theory of Switching, Part II, Harvard University Press, 1959, 285–292

    Google Scholar 

  • Orlin, J.B. [1993]: A faster strongly polynomial minimum cost flow algorithm. Operations Research 41 (1993), 338–350

    Article  MATH  MathSciNet  Google Scholar 

  • Pettie, S. [2004]: A new approach to all-pairs shortest paths on real-weighted graphs. Theoretical Computer Science 312 (2004), 47–74

    Article  MATH  MathSciNet  Google Scholar 

  • Pettie, S., Ramachandran, V. [2005]: Computing shortest paths with comparisons and additions. SIAM Journal on Computing 34 (2005), 1398–1431

    Article  MATH  MathSciNet  Google Scholar 

  • Radzik, T. [1993]: Parametric flows, weighted means of cuts, and fractional combinatorial optimization. In: Complexity in Numerical Optimization (P.M. Pardalos, ed.), World Scientific, Singapore 1993

    Google Scholar 

  • Raman, R. [1997]: Recent results on the single-source shortest paths problem. ACMSIGACT News 28 (1997), 81–87

    Article  Google Scholar 

  • Thorup, M. [1999]: Undirected single-source shortest paths with positive integer weights in linear time. Journal of the ACM 46 (1999), 362–394

    Article  MATH  MathSciNet  Google Scholar 

  • Thorup, M. [2000]: On RAM priority queues. SIAM Journal on Computing 30 (2000), 86–109

    Article  MATH  MathSciNet  Google Scholar 

  • Thorup, M. [2004]: Integer priority queues with decrease key in constant time and the single source shortest paths problem. Journal of Computer and System Sciences 69 (2004), 330–353

    Article  MATH  MathSciNet  Google Scholar 

  • Warshall, S. [1962]: A theorem on boolean matrices. Journal of the ACM 9 (1962), 11–12

    Article  MATH  MathSciNet  Google Scholar 

  • Zwick, U. [2002]: All pairs shortest paths using bridging sets and rectangular matrix multiplication. Journal of the ACM 49 (2002), 289–317

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute for Discrete Mathematics, University of Bonn, Lennéstraße 2, 53113, Bonn, Germany

    Bernhard Korte & Jens Vygen

  2. Faculté de mathématiques, Université Paris-VI, 175, rue du Chevaleret, 75013, Paris

    Jean Fonlupt (Professeur émérite)

  3. Panthéon-Sorbonne Centre d’économie de la Sorbonne, Université Paris-I, 106-112, boulevard de l’Hôpital, 75013, Paris

    Alexandre Skoda

Authors
  1. Bernhard Korte
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jens Vygen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jean Fonlupt
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Alexandre Skoda
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag France

About this chapter

Cite this chapter

Korte, B., Vygen, J., Fonlupt, J., Skoda, A. (2010). Plus courts chemins. In: Optimisation combinatoire. Collection IRIS. Springer, Paris. https://doi.org/10.1007/978-2-287-99037-3_7

Download citation

  • DOI: https://doi.org/10.1007/978-2-287-99037-3_7

  • Publisher Name: Springer, Paris

  • Print ISBN: 978-2-287-99036-6

  • Online ISBN: 978-2-287-99037-3

Publish with us

Policies and ethics

Search

Navigation