The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points.
From MaRDI portal
Publication:1430376
DOI10.1016/j.laa.2003.11.007zbMath1038.05031OpenAlexW2034321185MaRDI QIDQ1430376
M. Didi Biha, Ali Ridha Mahjoub
Publication date: 27 May 2004
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2003.11.007
Related Items
The \(k\)-node connected subgraph problem: polyhedral analysis and branch-and-cut, The \(k\) edge-disjoint 3-hop-constrained paths polytope, On the Steiner 2-edge connected subgraph polytope, A branch-and-cut algorithm for the k-edge connected subgraph problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The traveling salesman problem in graphs with some excluded minors
- Two-edge connected spanning subgraphs and polyhedra
- On perfectly two-edge connected graphs
- On two-connected subgraph polytopes
- The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs
- Steiner \(k\)-edge connected subgraph polyhedra
- \(k\)-edge connected polyhedra on series-parallel graphs
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
- On the Structure of Minimum-Weight k-Connected Spanning Networks
- The traveling salesman problem on a graph and some related integer polyhedra
- 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
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- The k-Edge-Connected Spanning Subgraph Polyhedron
- Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs
- Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements
- Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs
