On the Steiner 2-edge connected subgraph polytope

DOI10.1051/ro:2008022zbMath1157.05049OpenAlexW2022641305MaRDI QIDQ3598034

Pierre Pesneau, A. Rhida Mahjoub

Publication date: 29 January 2009

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105401

zbMATH Keywords

polytopeHalin graphSteiner 2-edge connected graph

Mathematics Subject Classification ID

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

Related Items (3)

A branch-and-cut algorithm for two-level survivable network design problems ⋮ Survivability in Hierarchical Telecommunications Networks Under Dual Homing ⋮ On the Steiner 2-edge connected subgraph polytope

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum-weight two-connected spanning networks
• Generalized Steiner problem in outerplanar networks
• The traveling salesman problem in graphs with some excluded minors
• Two-edge connected spanning subgraphs and polyhedra
• The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points.
• On survivable network polyhedra
• On two-connected subgraph polytopes
• The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs
• \(k\)-edge connected polyhedra on series-parallel graphs
• Critical extreme points of the 2-edge connected spanning subgraph polytope
• Separation of Partition Inequalities
• Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
• On the Structure of Minimum-Weight k-Connected Spanning Networks
• On the Steiner 2-edge connected subgraph polytope
• The traveling salesman problem on a graph and some related integer polyhedra
• Generalized steiner problem in series-parallel networks
• Send-and-Split Method for Minimum-Concave-Cost Network Flows
• Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
• Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
• The k-Edge-Connected Spanning Subgraph Polyhedron
• An Integer Polytope Related to the Design of Survivable Communication Networks
• Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs
• Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs
• Design of Survivable Networks: A survey

This page was built for publication: On the Steiner 2-edge connected subgraph polytope