Network Flow Problems

Network Flow Problems is a discrete optimization framework that models the maximum feasible flow through a directed graph subject to capacity constraints, distinguishing it from other combinatorial problems by its focus on conservation of flow at vertices and optimization over network topologies.

2.1K

Publications

147.2K

Citations

3.4K

Authors

1.2K

Institutions

Publications per year

2017–2026

251

Authors

3.4K

  1. JB
    James B. Orlin

    Massachusetts Institute of Technology, United States

    27 publications · 10.1K citations

    22

    h-index

  2. DP
    Dimitri P. Bertsekas

    Massachusetts Institute of Technology, United States

    22 publications · 2.2K citations

    18

    h-index

  3. SH
    Steven H. Low

    California Institute of Technology, United States

    20 publications · 3.1K citations

    16

    h-index

  4. ÉT
    Éva Tardos

    Cornell University, United States

    16 publications · 2K citations

    16

    h-index

  5. WY
    Wei‐Chang Yeh

    National Tsing Hua University, Taiwan

    18 publications · 767 citations

    16

    h-index

1–5 of 3.4K

Venues

  1. Operations Research

    82 publications · 8.5K citations

    45

    h-index

  2. Networks

    145 publications · 8.3K citations

    45

    h-index

  3. European Journal of Operational Research

    73 publications · 3.5K citations

    34

    h-index

  4. Management Science

    49 publications · 4.7K citations

    30

    h-index

  5. Mathematics of Operations Research

    40 publications · 2.8K citations

    28

    h-index

1–5