Dynamic Network Flows
Dynamic Network Flows is a mathematical modeling framework within network flow theory that extends static flow problems by incorporating time-dependent edge capacities and flow transit times, thereby enabling the representation and optimization of flows over time in capacitated networks.
271
Publications
13.8K
Citations
651
Authors
310
Institutions
Publications per year
2017–2026
55
Variants
Temporal Network Flows
271
The Quickest Transshipment Problem
Bruce Hoppe, Éva Tardos · Mathematics of Operations Research · 2000 · 306 citations
A survey of dynamic network flows
Jay E. Aronson · Annals of Operations Research · 1989 · 293 citations
1–5 of 271
651
7
h-index
6
h-index
5
h-index
4
h-index
4
h-index
1–5 of 651
310
University of Illinois Urbana-Champaign
Urbana, United States
12 h-index
15 publications
763 citations
Massachusetts Institute of Technology
Cambridge, United States
11 h-index
24 publications
1.9K citations

Cornell University
Ithaca, United States
7 h-index
10 publications
787 citations
Tsinghua University
Beijing, China
6 h-index
19 publications
517 citations
University of California, Davis
Davis, United States
6 h-index
9 publications
557 citations
Iowa State University
Ames, United States
5 h-index
9 publications
273 citations
Carnegie Mellon University
Pittsburgh, United States
5 h-index
7 publications
268 citations

Pennsylvania State University
State College, United States
5 h-index
7 publications
536 citations
1–8 of 310
20 publications · 937 citations
18
h-index
11 publications · 832 citations
11
h-index
8 publications · 1.5K citations
8
h-index
7 publications · 370 citations
7
h-index
6 publications · 388 citations
6
h-index
1–5