Network Flow Models

Network Flow Models is a mathematical optimization framework within linear programming that specializes in representing and solving problems involving the optimal movement of resources through a directed graph, distinguished by its focus on flow conservation constraints and capacity restrictions on arcs.

1.2K

Publications

90K

Citations

2.7K

Authors

944

Institutions

Publications per year

2017–2026

217

Authors

2.7K

  1. SH
    Steven H. Low

    California Institute of Technology, United States

    14 publications · 2.4K citations

    12

    h-index

  2. MD
    Martin D. F. Wong

    University of Illinois Urbana-Champaign, United States

    10 publications · 443 citations

    10

    h-index

  3. DR
    D. R. Fulkerson

    RAND Corporation, United States

    10 publications · 3.7K citations

    10

    h-index

  4. YL
    Yi‐Kuei Lin

    National Taiwan University of Science and Technology, Taiwan

    10 publications · 303 citations

    10

    h-index

  5. JB
    James B. Orlin

    Massachusetts Institute of Technology, United States

    10 publications · 8.5K citations

    10

    h-index

1–5 of 2.7K

Venues

  1. Networks

    55 publications · 3.6K citations

    32

    h-index

  2. Operations Research

    44 publications · 4K citations

    30

    h-index

  3. European Journal of Operational Research

    36 publications · 1.7K citations

    23

    h-index

  4. Management Science

    28 publications · 3.1K citations

    22

    h-index

  5. Transportation Research Part B Methodological

    21 publications · 1.9K citations

    19

    h-index

1–5