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

DOI10.1137/S0895480193259813MaRDI QIDQ4377432zbMATH OpenOpenAlexFDO

Authors Mourad Baïou, A. R. 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

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

Recommendations

• On the dominant of the Steiner 2-edge connected subgraph polytope
• Steiner k-edge connected subgraph polyhedra
• Two-edge connected spanning subgraphs and polyhedra
• On survivable network polyhedra

Cited in

(19)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377432)