Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs

DOI10.1137/S0895480193259813zbMath0884.05083OpenAlexW1975457241MaRDI QIDQ4377432

Mourad Baïou, Ali Ridha Mahjoub

Publication date: 9 February 1998

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480193259813

zbMATH Keywords

polytopesseries-parallel graphsSteiner 2-edge connected subgraphs

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (11)

The multiple Steiner TSP with order constraints: complexity and optimization algorithms ⋮ A branch-and-cut algorithm for two-level survivable network design problems ⋮ Robust capacitated Steiner trees and networks with uniform demands ⋮ The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points. ⋮ Circuit and bond polytopes on series-parallel graphs ⋮ On survivable network polyhedra ⋮ On the dominant of the Steiner 2-edge connected subgraph polytope ⋮ On the Steiner 2-edge connected subgraph polytope ⋮ A branch-and-cut algorithm for the k-edge connected subgraph problem ⋮ The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation ⋮ Critical extreme points of the 2-edge connected spanning subgraph polytope

This page was built for publication: Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs