Steiner \(k\)-edge connected subgraph polyhedra

DOI10.1023/A:1009893108387zbMath1031.90068OpenAlexW2012939571MaRDI QIDQ1977866

Yanyan Li

Publication date: 18 February 2004

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009893108387

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Interior-point methods (90C51)

Related Items (8)

Minimum Cost ≤k Edges Connected Subgraph Problems ⋮ Minimum‐weight subgraphs with unicyclic components and a lower‐bounded girth ⋮ Robust capacitated Steiner trees and networks with uniform demands ⋮ The \(k\) edge-disjoint 3-hop-constrained paths polytope ⋮ The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points. ⋮ A linear time algorithm for the minimum-weight feedback vertex set problem in series-parallel graphs ⋮ On survivable network polyhedra ⋮ A branch-and-cut algorithm for the k-edge connected subgraph problem

This page was built for publication: Steiner \(k\)-edge connected subgraph polyhedra