Network Flow Algorithms

Network Flow Algorithms is a class of combinatorial optimization algorithms on directed capacitated graphs that compute flows satisfying capacity and conservation constraints in order to optimize objectives such as maximizing throughput or minimizing cost between designated source and sink vertices.

5.2K

Publications

329K

Citations

9.5K

Authors

2.3K

Institutions

Publications per year

2017–2026

947

Authors

9.5K

  1. JB
    James B. Orlin

    Massachusetts Institute of Technology, United States

    34 publications · 10.7K citations

    27

    h-index

  2. WY
    Wei‐Chang Yeh

    National Tsing Hua University, Taiwan

    26 publications · 1.2K citations

    22

    h-index

  3. AV
    Andrew V. Goldberg

    Stanford University, United States

    27 publications · 2.9K citations

    22

    h-index

  4. RK
    Ravindra K. Ahuja

    University of Florida, United States

    25 publications · 9.9K citations

    21

    h-index

  5. SH
    Steven H. Low

    California Institute of Technology, United States

    30 publications · 2.6K citations

    20

    h-index

1–5 of 9.5K

Venues

  1. IEEE Transactions on Power Systems

    128 publications · 14.4K citations

    64

    h-index

  2. European Journal of Operational Research

    161 publications · 9.8K citations

    49

    h-index

  3. Operations Research

    88 publications · 8.4K citations

    47

    h-index

  4. Networks

    142 publications · 8.3K citations

    47

    h-index

  5. Computers & Operations Research

    118 publications · 7K citations

    45

    h-index

1–5