On perfectly two-edge connected graphs
From MaRDI portal
Publication:1363658
DOI10.1016/S0012-365X(96)00004-0zbMath0882.90125MaRDI QIDQ1363658
Publication date: 24 February 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)
Related Items
Survivability in hierarchical telecommunications networks, Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron, Box-total dual integrality and edge-connectivity, The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points., On the dominant of the Steiner 2-edge connected subgraph polytope, A branch-and-cut algorithm for the k-edge connected subgraph problem, The box-TDI system associated with 2-edge connected spanning subgraphs, The 2-edge-connected subgraph polyhedron, 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
- Minimum-weight two-connected spanning networks
- Survivable networks, linear programming relaxations and the parsimonious property
- Steiner problem in Halin networks
- On the relationship between the biconnectivity augmentation and traveling salesman problems
- The traveling salesman problem in graphs with some excluded minors
- Two-edge connected spanning subgraphs and polyhedra
- On two-connected subgraph polytopes
- The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs
- Topology of series-parallel networks
- Maximal Flow Through a Network
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
- The traveling salesman problem: An update of research
- 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
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- The k-Edge-Connected Spanning Subgraph Polyhedron
- Maximum matching and a polyhedron with 0,1-vertices
