Critical Extreme Points of the 2-Edge Connected Spanning Subgraph Polytope
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
The k edge-disjoint 3-hop-constrained paths polytope
Discrete Optimization
k-edge connected polyhedra on series-parallel graphs
Operations Research Letters
| Hi-index | 0.00 |
This paper studies the polyhedron Pk(G) defined by the convex hull of k-edge-connected spanning subgraphs of a given graph G where multiple copies of an edge are allowed. A complete inequality description of Pk(G) when k is odd and G is an outer planar graph is given. A family of facet-defining inequalities of Pk(G) that have the same support graph but coefficients that depend on $k\in \{4r - 2, 4r - 1, 4r + 1, r \in \{1, 2,. . .\}\} is described.