The Minimum-Cost Flow Problem is a network optimization problem that seeks to determine the least expensive way of routing a specified amount of flow through a directed graph while satisfying capacity constraints on arcs and minimizing the total cost associated with flow traversal.
651
Publications
35.1K
Citations
1.3K
Authors
538
Institutions
Publications per year
2017–2026
100
Variants
Minimum Cost Flow Problem
Publications
651
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
1–5 of 651
Authors
1.3K
- JB
15
h-index
- DPDimitri P. Bertsekas
Massachusetts Institute of Technology, United States
14 publications · 1.5K citations
13
h-index
- RK
12
h-index
- AV
10
h-index
- ÉT
9
h-index
1–5 of 1.3K
Institutions
538
Massachusetts Institute of Technology
Cambridge, United States
30 h-index
59 publications
5.2K citations
Stanford University
Stanford, United States
15 h-index
29 publications
2.8K citations
University of Florida
Gainesville, United States
13 h-index
16 publications
605 citations
Carnegie Mellon University
Pittsburgh, United States
13 h-index
25 publications
1.4K citations
The University of Texas at Austin
Austin, United States
11 h-index
17 publications
1.7K citations
Princeton University
Princeton, United States
11 h-index
13 publications
1.4K citations
University of California, Berkeley
Berkeley, United States
11 h-index
18 publications
837 citations
Tsinghua University
Beijing, China
10 h-index
25 publications
1K citations
1–8 of 538
Venues
- Networks
37 publications · 1.9K citations
24
h-index
- Operations Research
25 publications · 2.8K citations
21
h-index
- Management Science
22 publications · 3.2K citations
20
h-index
- European Journal of Operational Research
21 publications · 722 citations
16
h-index
- Mathematical Programming
14 publications · 794 citations
13
h-index
1–5