Network Flows

Network Flows is a branch of combinatorial optimization and graph theory that models and analyzes the movement of a conserved quantity through a directed, typically capacitated network subject to capacity and flow-conservation constraints between specified source and sink vertices.

5.2K

Publications

332.1K

Citations

9.6K

Authors

2.3K

Institutions

Publications per year

2017–2026

950

Authors

9.6K

  1. JB
    James B. Orlin

    Massachusetts Institute of Technology, United States

    36 publications · 11.2K citations

    28

    h-index

  2. RK
    Ravindra K. Ahuja

    University of Florida, United States

    28 publications · 10K citations

    23

    h-index

  3. AV
    Andrew V. Goldberg

    Stanford University, United States

    26 publications · 4.8K citations

    21

    h-index

  4. YL
    Yi‐Kuei Lin

    National Taiwan University of Science and Technology, Taiwan

    35 publications · 1.4K citations

    20

    h-index

  5. WY
    Wei‐Chang Yeh

    National Tsing Hua University, Taiwan

    26 publications · 1K citations

    20

    h-index

1–5 of 9.6K

Venues

  1. Operations Research

    93 publications · 10.9K citations

    51

    h-index

  2. Networks

    157 publications · 8.6K citations

    48

    h-index

  3. European Journal of Operational Research

    138 publications · 7.6K citations

    44

    h-index

  4. Transportation Research Part B Methodological

    77 publications · 6.1K citations

    44

    h-index

  5. IEEE/ACM Transactions on Networking

    TON · 85 publications · 11.2K citations

    41

    h-index

1–5