On the dominant of the s-t-cut polytope: Vertices, facets, and adjacency

被引：5

作者：

Skutella, Martin ^{[1
]}

Weber, Alexia ^{[1
]}

机构：

[1] Tech Univ Berlin, Inst Math, D-10623 Berlin, Germany

来源：

MATHEMATICAL PROGRAMMING | 2010年 / 124卷 / 1-2期

关键词：

Flows; Cuts; Polyhedral combinatorics; POLYHEDRON; NETWORK;

D O I：

10.1007/s10107-010-0373-7

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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 P(s-t-cut)(up arrow) of the s-t-cut polytope. We present a complete characterization of P(s-t-cut)(up arrow) with respect to vertices, facets, and adjacency.

引用

页码：441 / 454

页数：14

共 50 条

[1] On the dominant of the s-t-cut polytope: Vertices, facets, and adjacency
Martin Skutella
Alexia Weber
[J]. Mathematical Programming, 2010, 124 : 441 - 454
[2] Dominating an s-t-Cut in a Network
Rothenberger, Ralf
Grau, Sascha
Rossberg, Michael
[J]. SOFSEM 2015: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2015, 8939 : 401 - 411
[3] LIFTING FACETS OF THE CUT POLYTOPE
DESIMONE, C
[J]. OPERATIONS RESEARCH LETTERS, 1990, 9 (05) : 341 - 344
[4] Adjacency of vertices of the complete pre-order polytope
Gurgel, MACM
Wakabayashi, Y
[J]. DISCRETE MATHEMATICS, 1997, 175 (1-3) : 163 - 172
[5] Combinatorial structure and adjacency of vertices of polytope of b-factors
Simanchev R.Yu.
[J]. Russian Mathematics, 2014, 58 (6) : 51 - 62
[6] A class of hypergraphs and vertices of cut polytope relaxations
Bondarenko, V. A.
Nikolaev, A. V.
[J]. DOKLADY MATHEMATICS, 2012, 85 (01) : 46 - 47
[7] A class of hypergraphs and vertices of cut polytope relaxations
V. A. Bondarenko
A. V. Nikolaev
[J]. Doklady Mathematics, 2012, 85 : 46 - 47
[8] Facets of the (s, t)-p-path polytope
Stephan, Ruediger
[J]. DISCRETE APPLIED MATHEMATICS, 2009, 157 (14) : 3119 - 3132
[9] Generating facets for the cut polytope of a graph by triangular elimination
Avis, David
Imai, Hiroshi
Ito, Tsuyoshi
[J]. MATHEMATICAL PROGRAMMING, 2008, 112 (02) : 303 - 325
[10] Generating facets for the cut polytope of a graph by triangular elimination
David Avis
Hiroshi Imai
Tsuyoshi Ito
[J]. Mathematical Programming, 2008, 112 : 303 - 325

← 1 2 3 4 5 →