Network Flow Analysis
Network Flow Analysis is a methodological framework within network-based decision support that quantifies and optimizes the movement of entities across a road network by modeling flow dynamics, capacity constraints, and routing decisions in accordance with operations analysis principles.
350
Publications
35.1K
Citations
857
Authors
392
Institutions
Publications per year
2017–2026
82
350
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
Rudolf Ahlswede, Ning Cai, Shuo Li et al. · IEEE Transactions on Information Theory · 2000 · 7.9K citations
Network flows: Theory, algorithms and applications
Discrete Applied Mathematics · 1994 · 2.6K citations
The Boundary Specification Problem in Network Analysis
Linton C. Freeman · 2017 · 504 citations
1–5 of 350
857
7
h-index
5
h-index
4
h-index
4
h-index
3
h-index
1–5 of 857
392
National Tsing Hua University
Hsinchu, Taiwan
8 h-index
8 publications
257 citations
University of Michigan
Ann Arbor, United States
7 h-index
12 publications
274 citations
Technion – Israel Institute of Technology
Haifa, Israel
7 h-index
20 publications
762 citations
Massachusetts Institute of Technology
Cambridge, United States
6 h-index
10 publications
16.6K citations
Georgia Institute of Technology
Atlanta, United States
6 h-index
16 publications
443 citations
University of Castilla-La Mancha
Ciudad Real, Spain
5 h-index
14 publications
923 citations
Carnegie Mellon University
Pittsburgh, United States
5 h-index
12 publications
282 citations
Stanford University
Stanford, United States
5 h-index
8 publications
393 citations
1–8 of 392
11 publications · 344 citations
9
h-index
9 publications · 479 citations
9
h-index
6 publications · 310 citations
6
h-index
6 publications · 304 citations
6
h-index
6 publications · 132 citations
6
h-index
1–5