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

Authors

408

  1. MD
    Martin D. F. Wong

    University of Illinois Urbana-Champaign, United States

    5 publications · 144 citations

    5

    h-index

  2. LF
    Luis F. Ochoa

    University of Manchester, United Kingdom

    3 publications · 87 citations

    3

    h-index

  3. AP
    Anthony Papavasiliou

    UCLouvain, Belgium

    2 publications · 48 citations

    2

    h-index

  4. WM
    Wai-Kei Mak

    National Tsing Hua University, Taiwan

    2 publications · 27 citations

    2

    h-index

  5. RB
    Rakesh B. Bobba

    University of Illinois Urbana-Champaign, United States

    2 publications · 25 citations

    2

    h-index

1–5 of 408

Venues

  1. IEEE Transactions on Power Systems

    14 publications · 695 citations

    13

    h-index

  2. Electric Power Systems Research

    6 publications · 166 citations

    6

    h-index

  3. IEEE Transactions on Smart Grid

    6 publications · 610 citations

    6

    h-index

  4. Networks

    3 publications · 131 citations

    3

    h-index

  5. Operations Research

    3 publications · 376 citations

    3

    h-index

1–5