This paper studies the polyhedron Pₖ ( G ) definedd 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 Pₖ ( G ) when k is odd and G is an outer planar graph is given. A family of facet-defining inequalities of Pₖ ( G ) that have the same support graph but coefficients that depend on k ∈ \ 4r - 2, 4r - 1, 4r + 1,r ∈ t\ 1,2, … \ \ is described.
No takes yet. Share an insight, caveat, or question.
Sunil Chopra (1994) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: