Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes
نویسندگان
چکیده
منابع مشابه
Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes
Path-block-cycle inequalities are valid, and sometimes facet-defining, inequalities for polytopes in connection with graph partitioning problems and corresponding multicut problems. Special cases of the inequalities were introduced by De Souza & Laurent (1995) and shown to be facet-defining for the equicut polytope. Generalizations of these inequalities were shown by Ferreira et al. (1996) to b...
متن کاملFacets of Secondary Polytopes
The secondary polytope of a point configuration A is a polytope whose face poset is isomorphic to the poset of all regular subdivisions ofA. While the vertices of the secondary polytope – corresponding to the triangulations ofA – are very well studied, there is not much known about the facets of the secondary polytope. The splits of a polytope, subdivisions with exactly two maximal faces, are t...
متن کاملCoxeter n - polytopes with n + 3 facets
We use methods of combinatorics of polytopes together with geometrical and computational ones to obtain the complete list of compact hyperbolic Coxeter n-polytopes with n + 3 facets, 4 ≤ n ≤ 7. Combined with results of Esselmann [E1] this gives the classification of all compact hyperbolic Coxeter n-polytopes with n + 3 facets, n ≥ 4. Polytopes in dimensions 2 and 3 were classified by Poincaré [...
متن کاملCoxeter polytopes with mutually intersecting facets .
We prove that any compact hyperbolic Coxeter polytope except some well-known low-dimensional examples has a pair of disjoint facets. This is one of very few known general results concerning combinatorics of compact hyperbolic Coxeter polytopes. We also obtain a similar result for simple non-compact polytopes.
متن کاملEdge-Graph Diameter Bounds for Convex Polytopes with Few Facets
We show that the edge graph of a 6-dimensional polytope with 12 facets has diameter at most 6, thus verifying the d-step conjecture of Klee and Walkup in the case of d = 6. This implies that for all pairs (d, n) with n−d ≤ 6 the diameter of the edge graph of a d-polytope with n facets is bounded by 6, which proves the Hirsch conjecture for all n − d ≤ 6. We show this result by showing this boun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2017
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2017.03.001