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
Parents
433
A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
Éva Tardos · Operations Research · 1986 · 485 citations
A Faster Strongly Polynomial Minimum Cost Flow Algorithm
James B. Orlin · Operations Research · 1993 · 450 citations
Faster Scaling Algorithms for Network Problems
Harold N. Gabow, Robert E. Tarjan · SIAM Journal on Computing · 1989 · 421 citations
1–5 of 433
892
12
h-index
Massachusetts Institute of Technology, United States
11 publications · 993 citations
11
h-index
9
h-index
9
h-index
6
h-index
1–5 of 892
389
Massachusetts Institute of Technology
Cambridge, United States
19 h-index
27 publications
2.8K citations
Stanford University
Stanford, United States
12 h-index
19 publications
1.4K citations
Princeton University
Princeton, United States
10 h-index
11 publications
1K citations
University of Florida
Gainesville, United States
10 h-index
12 publications
419 citations
University of Bonn
Bonn, Germany
10 h-index
18 publications
1.3K citations
University of California, Berkeley
Berkeley, United States
8 h-index
12 publications
529 citations

Tel Aviv University
Tel Aviv, Israel
8 h-index
9 publications
234 citations

National Taiwan University
Taipei, Taiwan
7 h-index
13 publications
588 citations
1–8 of 389
19 publications · 2.1K citations
18
h-index
21 publications · 1.1K citations
16
h-index
15 publications · 2.1K citations
14
h-index
14 publications · 515 citations
12
h-index
10 publications · 304 citations
10
h-index
1–5