Changes between Initial Version and Version 2 of Ticket #28837


Ignore:
Timestamp:
Dec 4, 2019, 1:05:49 PM (3 years ago)
Author:
Jonas Frede
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #28837

    • Property Keywords multi-digraphs digraphs linear programming combinatorial optimization added
  • Ticket #28837 – Description

    initial v2  
    1 Flow polytopes of directed graphs are the convex hulls of nonnegative flow values for the arcs of said digraph such that the flow is conserved on internal vertices, and there is a unit of flow entering the sources and leaving the sinks.
     1Flow polytopes of directed graphs are the convex hulls of nonnegative flow values for the arcs of said digraph such that the flow is conserved on internal vertices, and there is a unit of flow leaving the sources and entering the sinks.
    22
    33Yet, while working with multi-digraphs where there are multiple arcs in the same (!) direction for some vertex pairs, the nonnegativity conditions may be violated and the flow polytope will not be a subset of the 0/1-cube any more.