On the dominant of the `s`-`t`-cut polytope

dc.contributor.authorSkutella, Martin
dc.contributor.authorWeber, Alexia
dc.date.accessioned2021-12-17T10:07:45Z
dc.date.available2021-12-17T10:07:45Z
dc.date.issued2008
dc.description.abstractThe 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.issn2197-8085
dc.identifier.urihttps://depositonce.tu-berlin.de/handle/11303/15632
dc.identifier.urihttp://dx.doi.org/10.14279/depositonce-14405
dc.language.isoenen
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subject.ddc510 Mathematiken
dc.subject.otherflowsen
dc.subject.othercutsen
dc.subject.otherpolyhedral combinatoricsen
dc.titleOn the dominant of the `s`-`t`-cut polytopeen
dc.typeResearch Paperen
dc.type.versionsubmittedVersionen
tub.accessrights.dnbfreeen
tub.affiliationFak. 2 Mathematik und Naturwissenschaften::Inst. Mathematikde
tub.affiliation.facultyFak. 2 Mathematik und Naturwissenschaftende
tub.affiliation.instituteInst. Mathematikde
tub.publisher.universityorinstitutionTechnische Universität Berlinen
tub.series.issuenumber2008, 30en
tub.series.namePreprint-Reihe des Instituts für Mathematik, Technische Universität Berlinen
tub.subject.msc200090C05 Linear programmingen
tub.subject.msc200090C27 Combinatorial optimizationen
tub.subject.msc200090C35 Programming involving graphs or networksen
tub.subject.msc200090C57 Polyhedral combinatorics, branch-and-bound, branch-and-cuten

Files

Original bundle
Now showing 1 - 1 of 1
Loading…
Thumbnail Image
Name:
Report-030-2008.pdf
Size:
166.91 KB
Format:
Adobe Portable Document Format

Collections