Skip to main content
SpringerLink
Log in

Flots dans les réseaux

  • Chapter
Optimisation combinatoire

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

  • 648 Accesses

Résumé

Dans ce chapitre et dans le suivant nous étudierons les flots dans les réseaux: soit un graphe orienté G avec des capacités u: E(G)→ℝ+ associées aux arcs et deux sommets particuliers, s (la source) et t (le puits). Le quadruplet (G; u; s; t) sera appelé un réseau.

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

    Google Scholar 

  • Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A. [1998]: Combinatorial Optimization. Wiley, New York 1998, Chapter 3

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  • Ford, L.R., Fulkerson, D.R. [1962]: Flows in Networks. Princeton University Press, Princeton 1962

    MATH  Google Scholar 

  • Frank, A. [1995]: Connectivity and network flows. In: Handbook of Combinatorics; Vol. 1 (R.L. Graham, M. Grötschel, L. Lovász, eds.), Elsevier, Amsterdam, 1995

    Google Scholar 

  • Goldberg, A.V., Tardos, É., Tarjan, R.E. [1990]: Network flow algorithms. In: Paths, Flows, and VLSI-Layout (B. Korte, L. Lovász, H.J. Prömel, A. Schrijver, eds.), Springer, Berlin 1990, pp. 101–164

    Google Scholar 

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

    MATH  Google Scholar 

  • Jungnickel, D. [1999]: Graphs, Networks and Algorithms. Springer, Berlin 1999

    Google Scholar 

  • Phillips, D.T., Garcia-Diaz, A. [1981]: Fundamentals of Network Analysis. Prentice-Hall, Englewood Cliffs 1981

    MATH  Google Scholar 

  • Ruhe, G. [1991]: Algorithmic Aspects of Flows in Networks. Kluwer Academic Publishers, Dordrecht 1991

    MATH  Google Scholar 

  • Schrijver, A. [2003]: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin 2003, Chapters 9,10,13–15

    MATH  Google Scholar 

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

    Google Scholar 

  • Thulasiraman, K., Swamy, M.N.S. [1992]: Graphs: Theory and Algorithms. Wiley, New York 1992, Chapter 12

    MATH  Google Scholar 

Références citées

  • Ahuja, R.K., Orlin, J.B., Tarjan, R.E. [1989]: Improved time bounds for the maximum flow problem. SIAM Journal on Computing 18 (1989), 939–954

    Article  MathSciNet  MATH  Google Scholar 

  • Borradaile, G. Klein, P. [2006]: An O(n log n) algorithm for maximum st-flow in a directed planar graph. Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (2006), 524–533

    Google Scholar 

  • Cheriyan, J., Maheshwari, S.N. [1989]: Analysis of preflow push algorithms for maximum network flow. SIAM Journal on Computing 18 (1989), 1057–1086

    Article  MathSciNet  MATH  Google Scholar 

  • Cheriyan, J., Mehlhorn, K. [1999]: An analysis of the highest-level selection rule in the preflow-push max-flow algorithm. Information Processing Letters 69 (1999), 239–242

    Article  MathSciNet  Google Scholar 

  • Cherkassky, B.V. [1977]: Algorithm of construction of maximal flow in networks with complexity of \( O(V^2 \sqrt E ) \) operations. Mathematical Methods of Solution of Economical Problems 7 (1977), 112–125 [in Russian]

    Google Scholar 

  • Cheung, K.K.H., Cunningham, W.H., Tang, L. [2006]: Optimal 3-terminal cuts and linear programming. Mathematical Programming 106 (2006), 1–23

    Article  MathSciNet  MATH  Google Scholar 

  • Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M. [1994]: The complexity of multiterminal cuts. SIAM Journal on Computing 23 (1994), 864–894

    Article  MathSciNet  MATH  Google Scholar 

  • Dantzig, G.B., Fulkerson, D.R. [1956]: On the max-flow min-cut theorem of networks. In: Linear Inequalities and Related Systems (H.W. Kuhn, A.W. Tucker, eds.), Princeton University Press, Princeton 1956, pp. 215–221

    Google Scholar 

  • Dinic, E.A. [1970]: Algorithm for solution of a problem of maximum flow in a network with power estimation. Soviet Mathematics Doklady 11 (1970), 1277–1280

    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 

  • Elias, P., Feinstein, A., Shannon, C.E. [1956]: Note on maximum flow through a network. IRE Transactions on Information Theory, IT-2 (1956), 117–119

    Google Scholar 

  • Ford, L.R., Fulkerson, D.R. [1956]: Maximal Flow Through a Network. Canadian Journal of Mathematics 8 (1956), 399–404

    MathSciNet  MATH  Google Scholar 

  • Ford, L.R., Fulkerson, D.R. [1957]: A simple algorithm for finding maximal network flows and an application to the Hitchcock problem. Canadian Journal of Mathematics 9 (1957), 210–218

    MathSciNet  MATH  Google Scholar 

  • Frank, A. [1994]: On the edge-connectivity algorithm of Nagamochi and Ibaraki. Laboratoire Artemis, IMAG, Université J. Fourier, Grenoble, 1994

    Google Scholar 

  • Fujishige, S. [2003]: A maximum flow algorithm using MA ordering. Operations Research Letters 31 (2003), 176–178

    Article  MathSciNet  MATH  Google Scholar 

  • Gabow, H.N. [1995]: A matroid approach to finding edge connectivity and packing arborescences. Journal of Computer and System Sciences 50 (1995), 259–273

    Article  MathSciNet  MATH  Google Scholar 

  • Galil, Z. [1980]: An \( O(V^{\tfrac{5} {3}} E^{\tfrac{2} {3}} ) \) algorithm for the maximal flow problem. Acta Informatica 14 (1980), 221–242

    Article  MathSciNet  MATH  Google Scholar 

  • Galil, Z., Namaad, A. [1980]: An O(EV log2 V) algorithm for the maximal flow problem. Journal of Computer and System Sciences 21 (1980), 203–217

    Article  MathSciNet  MATH  Google Scholar 

  • Gallai, T. [1958]: Maximum-minimum Sätze über Graphen. Acta Mathematica Academiae Scientiarum Hungaricae 9 (1958), 395–434

    Article  MathSciNet  MATH  Google Scholar 

  • Goldberg, A.V., Rao, S. [1998]: Beyond the flow decomposition barrier. Journal of the ACM 45 (1998), 783–797

    Article  MathSciNet  MATH  Google Scholar 

  • Goldberg, A.V., Tarjan, R.E. [1988]: A new approach to the maximum flow problem. Journal of the ACM 35 (1988), 921–940

    Article  MathSciNet  MATH  Google Scholar 

  • Gomory, R.E., Hu, T.C. [1961]: Multi-terminal network flows. Journal of SIAM 9 (1961), 551–570

    MathSciNet  MATH  Google Scholar 

  • Gusfield, D. [1990]: Very simple methods for all pairs network flow analysis. SIAM Journal on Computing 19 (1990), 143–155

    Article  MathSciNet  MATH  Google Scholar 

  • Hao, J., Orlin, J.B. [1994]: A faster algorithm for finding the minimum cut in a directed graph. Journal of Algorithms 17 (1994), 409–423

    Article  MathSciNet  Google Scholar 

  • Henzinger, M.R., Rao, S., Gabow, H.N. [2000]: Computing vertex connectivity: new bounds from old techniques. Journal of Algorithms 34 (2000), 222–250

    Article  MathSciNet  MATH  Google Scholar 

  • Hoffman, A.J. [1960]: Some recent applications of the theory of linear inequalities to extremal combinatorial analysis. In: Combinatorial Analysis (R.E. Bellman, M. Hall, eds.), AMS, Providence 1960, pp. 113–128

    Google Scholar 

  • Hu, T.C. [1969]: Integer Programming and Network Flows. Addison-Wesley, Reading 1969

    MATH  Google Scholar 

  • Karger, D.R. [2000]: Minimum cuts in near-linear time. Journal of the ACM 47 (2000), 46–76

    Article  MathSciNet  MATH  Google Scholar 

  • Karger, D.R., Levine, M.S. [1998]: Finding maximum flows in undirected graphs seems easier than bipartite matching. Proceedings of the 30th Annual ACM Symposium on Theory of Computing (1998), 69–78

    Google Scholar 

  • Karger, D.R., Stein, C. [1996]: A new approach to the minimum cut problem. Journal of the ACM 43 (1996), 601–640

    Article  MathSciNet  MATH  Google Scholar 

  • Karzanov, A.V. [1974]: Determining the maximal flow in a network by the method of pre-flows. Soviet Mathematics Doklady 15 (1974), 434–437

    MATH  Google Scholar 

  • King, V., Rao, S., Tarjan, R.E. [1994]: A faster deterministic maximum flow algorithm. Journal of Algorithms 17 (1994), 447–474

    Article  MathSciNet  Google Scholar 

  • Mader, W. [1972]: Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. Arch. Math. 23 (1972), 553–560

    Article  MathSciNet  MATH  Google Scholar 

  • Mader, W. [1981]: On a property of n edge-connected digraphs. Combinatorica 1 (1981), 385–386

    Article  MathSciNet  MATH  Google Scholar 

  • Malhotra, V.M., Kumar, M.P., Maheshwari, S.N. [1978]: An O(|V|3) algorithm for finding maximum flows in networks. Information Processing Letters 7 (1978), 277–278

    Article  MathSciNet  MATH  Google Scholar 

  • Menger, K. [1927]: Zur allgemeinen Kurventheorie. Fundamenta Mathematicae 10 (1927), 96–115

    MATH  Google Scholar 

  • Nagamochi, H., Ibaraki, T. [1992]: Computing edge-connectivity in multigraphs and capacitated graphs. SIAM Journal on Discrete Mathematics 5 (1992), 54–66

    Article  MathSciNet  MATH  Google Scholar 

  • Nagamochi, H., Ibaraki, T. [2000]: A fast algorithm for computing minimum 3-way and 4-way cuts. Mathematical Programming 88 (2000), 507–520

    Article  MathSciNet  MATH  Google Scholar 

  • Phillips, S., Dessouky, M.I. [1977]: Solving the project time/cost tradeoff problem using the minimal cut concept. Management Science 24 (1977), 393–400

    Article  MATH  Google Scholar 

  • Picard, J., Queyranne, M. [1980]: On the structure of all minimum cuts in a network and applications. Mathematical Programming Study 13 (1980), 8–16

    MathSciNet  MATH  Google Scholar 

  • Queyranne, M. [1998]: Minimizing symmetric submodular functions. Mathematical Programming B 82 (1998), 3–12

    MathSciNet  Google Scholar 

  • Rose, D.J. [1970]: Triangulated graphs and the elimination process. Journal of Mathematical Analysis and Applications 32 (1970), 597–609

    Article  MathSciNet  MATH  Google Scholar 

  • Shiloach, Y. [1978]: An O(nI log2 I) maximum-flow algorithm. Technical Report STANCS-78-802, Computer Science Department, Stanford University, 1978

    Google Scholar 

  • Shiloach, Y. [1979]: Edge-disjoint branching in directed multigraphs. Information Processing Letters 8 (1979), 24–27

    Article  MathSciNet  MATH  Google Scholar 

  • Shioura, A. [2004]: The MA ordering max-flow algorithm is not strongly polynomial for directed networks. Operations Research Letters 32 (2004), 31–35

    Article  MathSciNet  MATH  Google Scholar 

  • Sleator, D.D. [1980]: An O(nm log n) algorithm for maximum network flow. Technical Report STAN-CS-80-831, Computer Science Department, Stanford University, 1978

    Google Scholar 

  • Sleator, D.D., Tarjan, R.E. [1983]: A data structure for dynamic trees. Journal of Computer and System Sciences 26 (1983), 362–391

    Article  MathSciNet  MATH  Google Scholar 

  • Su, X.Y. [1997]: Some generalizations of Menger’s theorem concerning arc-connected digraphs. Discrete Mathematics 175 (1997), 293–296

    Article  MathSciNet  MATH  Google Scholar 

  • Stoer, M., Wagner, F. [1997]: A simple min cut algorithm. Journal of the ACM 44 (1997), 585–591

    Article  MathSciNet  MATH  Google Scholar 

  • Tunçel, L. [1994]: On the complexity preflow-push algorithms for maximum flow problems. Algorithmica 11 (1994), 353–359

    Article  MathSciNet  MATH  Google Scholar 

  • Vazirani, V.V., Yannakakis, M. [1992]: Suboptimal cuts: their enumeration, weight, and number. In: Automata, Languages and Programming; Proceedings; LNCS 623 (W. Kuich, ed.), Springer, Berlin 1992, pp. 366–377

    Google Scholar 

  • Vygen, J. [2002]: On dual minimum cost flow algorithms. Mathematical Methods of Operations Research 56 (2002), 101–126

    Article  MathSciNet  MATH  Google Scholar 

  • Weihe, K. [1997]: Maximum (s; t)-flows in planar networks in O(∣v∣log∣V∣) time. Journal of Computer and System Sciences 55 (1997), 454–475

    Article  MathSciNet  MATH  Google Scholar 

  • Whitney, H. [1932]: Congruent graphs and the connectivity of graphs. American Journal of Mathematics 54 (1932), 150–168

    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). Flots dans les réseaux. In: Optimisation combinatoire. Collection IRIS. Springer, Paris. https://doi.org/10.1007/978-2-287-99037-3_8

Download citation

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

  • 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