Minimum-cost Flow Algorithms

Minimum-Cost Flow Algorithms is a class of optimization algorithms in network flow theory that determines the least expensive way to route a specified amount of flow through a directed graph while satisfying capacity constraints and minimizing total cost.

433

Publications

23.8K

Citations

892

Authors

389

Institutions

Publications per year

2017–2026

64

Variants

Minimum Cost Flow Algorithms

Authors

892

  1. JB
    James B. Orlin

    Massachusetts Institute of Technology, United States

    12 publications · 1.2K citations

    12

    h-index

  2. DP
    Dimitri P. Bertsekas

    Massachusetts Institute of Technology, United States

    11 publications · 993 citations

    11

    h-index

  3. RK
    Ravindra K. Ahuja

    University of Florida, United States

    9 publications · 441 citations

    9

    h-index

  4. AV
    Andrew V. Goldberg

    Stanford University, United States

    9 publications · 636 citations

    9

    h-index

  5. RE
    Robert E. Tarjan

    Princeton University, United States

    6 publications · 1.1K citations

    6

    h-index

1–5 of 892

Venues

  1. Operations Research

    19 publications · 2.1K citations

    18

    h-index

  2. Networks

    21 publications · 1.1K citations

    16

    h-index

  3. Management Science

    15 publications · 2.1K citations

    14

    h-index

  4. European Journal of Operational Research

    14 publications · 515 citations

    12

    h-index

  5. 10

    h-index

1–5