Network Flow Constraints
Network Flow Constraints is a formal mathematical framework within constraint modeling that specifies conservation and capacity conditions on the flow of quantities through a directed graph, distinguishing it from other constraint types by enforcing flow balance at nodes and flow limits on edges.
128
Publications
6.5K
Citations
408
Authors
204
Institutions
Publications per year
2017–2026
40
Parents
128
Nicholas Good, Pierluigi Mancarella · IEEE Transactions on Smart Grid · 2017 · 224 citations · Full text
1–5 of 128
408
University of Illinois Urbana-Champaign, United States
5 publications · 144 citations
5
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 408
204
University of Illinois Urbana-Champaign
Urbana, United States
5 h-index
11 publications
318 citations
University of California, Berkeley
Berkeley, United States
5 h-index
11 publications
514 citations

University of Manchester
Manchester, United Kingdom
4 h-index
6 publications
384 citations
Tsinghua University
Beijing, China
4 h-index
17 publications
1.2K citations
KU Leuven
Leuven, Belgium
3 h-index
8 publications
152 citations

Xi'an Jiaotong University
Xi'an, China
3 h-index
7 publications
379 citations

The University of Sydney
Sydney, Australia
3 h-index
5 publications
425 citations

The University of Melbourne
Melbourne, Australia
3 h-index
11 publications
373 citations
1–8 of 204
14 publications · 695 citations
13
h-index
6 publications · 166 citations
6
h-index
6 publications · 610 citations
6
h-index
3 publications · 131 citations
3
h-index
3 publications · 376 citations
3
h-index
1–5