Critical extreme points of the 2-edge connected spanning subgraph polytope
From MaRDI portal
Publication:2583127
DOI10.1007/s10107-005-0654-8zbMath1085.90008OpenAlexW2123324452MaRDI QIDQ2583127
Jean Fonlupt, Ali Ridha Mahjoub
Publication date: 13 January 2006
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-005-0654-8
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items
Survivability in hierarchical telecommunications networks, Box-total dual integrality and edge-connectivity, 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, Critical extreme points of the 2-edge connected spanning subgraph polytope
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Steiner problem in Halin networks
- The traveling salesman problem in graphs with some excluded minors
- Design of survivable networks
- Two-edge connected spanning subgraphs and polyhedra
- On perfectly two-edge connected graphs
- Polyhedral results for two-connected networks with bounded rings
- 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
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
- On the Polytope of the (1,2)-Survivable Network Design Problem
- 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
- Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- 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
- Solving the Two-Connected Network with Bounded Meshes Problem
- Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
- 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
- Design of Survivable Networks: A survey
