On the dominant of the `s`-`t`-cut polytope
dc.contributor.author | Skutella, Martin | |
dc.contributor.author | Weber, Alexia | |
dc.date.accessioned | 2021-12-17T10:07:45Z | |
dc.date.available | 2021-12-17T10:07:45Z | |
dc.date.issued | 2008 | |
dc.description.abstract | 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 polyhedron with respect to vertices, facets, and adjacency. | en |
dc.identifier.issn | 2197-8085 | |
dc.identifier.uri | https://depositonce.tu-berlin.de/handle/11303/15632 | |
dc.identifier.uri | http://dx.doi.org/10.14279/depositonce-14405 | |
dc.language.iso | en | en |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
dc.subject.ddc | 510 Mathematik | en |
dc.subject.other | flows | en |
dc.subject.other | cuts | en |
dc.subject.other | polyhedral combinatorics | en |
dc.title | On the dominant of the `s`-`t`-cut polytope | en |
dc.type | Research Paper | en |
dc.type.version | submittedVersion | en |
tub.accessrights.dnb | free | en |
tub.affiliation | Fak. 2 Mathematik und Naturwissenschaften::Inst. Mathematik | de |
tub.affiliation.faculty | Fak. 2 Mathematik und Naturwissenschaften | de |
tub.affiliation.institute | Inst. Mathematik | de |
tub.publisher.universityorinstitution | Technische Universität Berlin | en |
tub.series.issuenumber | 2008, 30 | en |
tub.series.name | Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin | en |
tub.subject.msc2000 | 90C05 Linear programming | en |
tub.subject.msc2000 | 90C27 Combinatorial optimization | en |
tub.subject.msc2000 | 90C35 Programming involving graphs or networks | en |
tub.subject.msc2000 | 90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut | en |
Files
Original bundle
1 - 1 of 1