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
Parents
2.1K
Network Flows: Theory, Algorithms, and Applications.
David K. Smith, Ravindra K. Ahuja, Thomas L. Magnanti et al. · Journal of the Operational Research Society · 1994 · 8.2K citations · Full text
Network flows: Theory, algorithms and applications
Discrete Applied Mathematics · 1994 · 2.6K citations
Maximal Flow Through a Network
L. R. Ford, D. R. Fulkerson · Canadian Journal of Mathematics · 1956 · 2.3K citations · Full text
1–5 of 2.1K
3.4K
22
h-index
Massachusetts Institute of Technology, United States
22 publications · 2.2K citations
18
h-index
16
h-index
16
h-index
16
h-index
1–5 of 3.4K
1.2K
Massachusetts Institute of Technology
Cambridge, United States
54 h-index
162 publications
34.7K citations
Princeton University
Princeton, United States
30 h-index
69 publications
7.8K citations

Cornell University
Ithaca, United States
30 h-index
69 publications
5.7K citations
University of California, Berkeley
Berkeley, United States
29 h-index
71 publications
7.3K citations
Stanford University
Stanford, United States
25 h-index
53 publications
4.7K citations
Columbia University
New York, United States
24 h-index
43 publications
3.3K citations
Georgia Institute of Technology
Atlanta, United States
23 h-index
49 publications
2.1K citations

Tel Aviv University
Tel Aviv, Israel
23 h-index
52 publications
2K citations
1–8 of 1.2K
82 publications · 8.5K citations
45
h-index
145 publications · 8.3K citations
45
h-index
73 publications · 3.5K citations
34
h-index
49 publications · 4.7K citations
30
h-index
40 publications · 2.8K citations
28
h-index
1–5