A branch-and-cut algorithm for the k-edge connected subgraph problem
From MaRDI portal
Publication:3057129
Recommendations
- The k-node connected subgraph problem: polyhedral analysis and branch-and-cut
- The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points.
- scientific article; zbMATH DE number 764407
- Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
Cites work
- scientific article; zbMATH DE number 176255 (Why is no real title available?)
- scientific article; zbMATH DE number 2196281 (Why is no real title available?)
- A new approach to the maximum-flow problem
- An Integer Polytope Related to the Design of Survivable Communication Networks
- Critical extreme points of the 2-edge connected spanning subgraph polytope
- Design of Survivable Networks: A survey
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
- Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs
- Multi-Terminal Network Flows
- On perfectly two-edge connected graphs
- On the 3-Terminal Cut Polyhedron
- On the Structure of Minimum-Weight k-Connected Spanning Networks
- On the relationship between the biconnectivity augmentation and traveling salesman problems
- On two-connected subgraph polytopes
- Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements
- Quantum abacus
- Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs
- Steiner \(k\)-edge connected subgraph polyhedra
- The k-Edge-Connected Spanning Subgraph Polyhedron
- The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points.
- The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs
- The traveling salesman problem in graphs with some excluded minors
- The traveling salesman problem on a graph and some related integer polyhedra
- Two-edge connected spanning subgraphs and polyhedra
- Very Simple Methods for All Pairs Network Flow Analysis
- k-edge connected polyhedra on series-parallel graphs
Cited in
(16)- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
- On the \(k\)-edge-incident subgraph problem and its variants
- The k edge-disjoint 3-hop-constrained paths polytope
- Survivability in hierarchical telecommunications networks
- Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem
- \(k\)-edge subgraph problems
- The k-Edge-Connected Spanning Subgraph Polyhedron
- Probabilistic properties of highly connected random geometric graphs
- Network design with vulnerability constraints and probabilistic edge reliability
- The k-node connected subgraph problem: polyhedral analysis and branch-and-cut
- On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem
- A branch \& cut algorithm for the maximum common edge subgraph problem
- The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points.
- Design of survivable networks with low connectivity requirements
- Box-total dual integrality and edge-connectivity
- scientific article; zbMATH DE number 764407 (Why is no real title available?)
This page was built for publication: A branch-and-cut algorithm for the \(k\)-edge connected subgraph problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3057129)
