Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs
From MaRDI portal
Publication:4377432
DOI10.1137/S0895480193259813zbMATH Open0884.05083OpenAlexW1975457241MaRDI QIDQ4377432FDOQ4377432
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
Recommendations
Cited In (16)
- 2-connected and 2-edge-connected Steinhaus graphs
- \(k\)-edge connected polyhedra on series-parallel graphs
- On Steiner 2-edge connected polytopes
- On the dominant of the Steiner 2-edge connected subgraph polytope
- Circuit and bond polytopes on series-parallel graphs
- On the Steiner 2-edge connected subgraph polytope
- Robust capacitated Steiner trees and networks with uniform demands
- The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation
- The multiple Steiner TSP with order constraints: complexity and optimization algorithms
- A branch-and-cut algorithm for two-level survivable network design problems
- Critical extreme points of the 2-edge connected spanning subgraph polytope
- Design of survivable networks with low connectivity requirements
- The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points.
- A branch-and-cut algorithm for the \(k\)-edge connected subgraph problem
- Two-edge connected spanning subgraphs and polyhedra
- On survivable network polyhedra
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)
