Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14405
For citation please use:
Main Title: On the dominant of the `s`-`t`-cut polytope
Author(s): Skutella, Martin
Weber, Alexia
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15632
http://dx.doi.org/10.14279/depositonce-14405
License: http://rightsstatements.org/vocab/InC/1.0/
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.
Subject(s): flows
cuts
polyhedral combinatorics
Issue Date: 2008
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
MSC 2000: 90C05 Linear programming
90C27 Combinatorial optimization
90C35 Programming involving graphs or networks
90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2008, 30
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-030-2008.pdf
Format: Adobe PDF | Size: 166.91 kB
DownloadShow Preview
Thumbnail

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.