TY - GEN A1 - Skutella, Martin A1 - Weber, Alexia T1 - On the dominant of the s-t-cut polytope N2 - The natural linear programming formulation of the maximum s-t-flow problem in path variables has a dual linear program whose underlying polyhedron is the dominant of the s-t-cut polytope. We present a complete characterization of this polytope with respect to vertices, facets, and adjacency. KW - flows KW - cuts KW - polyhedral combinatorics Y1 - 2009 UR - https://opus4.kobv.de/opus4-matheon/frontdoor/index/index/docId/583 UR - https://nbn-resolving.org/urn:nbn:de:0296-matheon-5839 ER -