Network Flow Formulations
Network Flow Formulations is a mathematical modeling framework within the class of optimization techniques that represents assignment problems as directed graphs with flow variables, capacity constraints, and conservation laws to systematically capture the allocation of agents to tasks under flow-preservation principles.
619
Publications
44.5K
Citations
1.3K
Authors
559
Institutions
Publications per year
2017–2026
62
Parents
619
Maximal Flow Through a Network
L. R. Ford, D. R. Fulkerson · Canadian Journal of Mathematics · 1956 · 2.3K citations · Full text
Robust discrete optimization and network flows
Dimitris Bertsimas, Melvyn Sim · Mathematical Programming · 2003 · 1.8K citations
1–5 of 619
1.3K
10
h-index
United States Air Force Research Laboratory, United States
6 publications · 373 citations
6
h-index
6
h-index
United States Air Force Research Laboratory, United States
6 publications · 523 citations
6
h-index
5
h-index
1–5 of 1.3K
559
Massachusetts Institute of Technology
Cambridge, United States
19 h-index
27 publications
5.7K citations
Georgia Institute of Technology
Atlanta, United States
13 h-index
24 publications
938 citations
Université de Montréal
Montreal, Canada
13 h-index
22 publications
1.3K citations
National Central University
Taoyuan City, Taiwan
12 h-index
27 publications
1K citations
University of California, Berkeley
Berkeley, United States
11 h-index
16 publications
1K citations
Carnegie Mellon University
Pittsburgh, United States
10 h-index
15 publications
1.3K citations
The University of Texas at Austin
Austin, United States
10 h-index
16 publications
808 citations
University of Illinois Urbana-Champaign
Urbana, United States
10 h-index
18 publications
1.2K citations
1–8 of 559
26 publications · 2.1K citations
23
h-index
23 publications · 3K citations
21
h-index
26 publications · 2.1K citations
19
h-index
30 publications · 1.8K citations
19
h-index
17 publications · 2.6K citations
13
h-index
1–5