Flow Polytopes

Flow Polytopes is a convex polytope in network flow theory defined as the set of all feasible flows on a directed graph satisfying prescribed source-sink demands, with the polytope's structure determined by the graph's arc capacities and flow conservation constraints.

16

Publications

552

Citations

30

Authors

30

Institutions

Publications per year

2017–2026

4

Authors

30

  1. KM
    Karola Mészáros

    Cornell University, United States

    4 publications · 77 citations

    4

    h-index

  2. CS
    Claudio Sodini

    University of Pisa, Italy

    2 publications · 41 citations

    2

    h-index

  3. AH
    Alejandro H. Morales

    University of California, Los Angeles, United States

    2 publications · 58 citations

    2

    h-index

  4. MV
    Michèle Vergne

    École Polytechnique, France

    2 publications · 103 citations

    2

    h-index

  5. AA
    Alper Atamtürk

    University of California, Berkeley, United States

    1 publications · 65 citations

    1

    h-index

1–5 of 30

Venues

  1. International Mathematics Research Notices

    IMRN · 1 publications · 37 citations

    1

    h-index

  2. SIAM Journal on Discrete Mathematics

    1 publications · 11 citations

    1

    h-index

  3. Transformation Groups

    1 publications · 55 citations

    1

    h-index

  4. SIAM Journal on Computing

    1 publications · 84 citations

    1

    h-index

  5. Optimization

    1 publications · 26 citations

    1

    h-index

1–5