Two-edge connected spanning subgraphs and polyhedra
From MaRDI portal
Recommendations
Cites work
- A Cutting Plane Algorithm for the Linear Ordering Problem
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
- scientific article; zbMATH DE number 3646634 (Why is no real title available?)
- scientific article; zbMATH DE number 3898613 (Why is no real title available?)
- scientific article; zbMATH DE number 176255 (Why is no real title available?)
- scientific article; zbMATH DE number 3349645 (Why is no real title available?)
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
- Maximal Flow Through a Network
- Minimum-weight two-connected spanning networks
- On the relationship between the biconnectivity augmentation and traveling salesman problems
- On two-connected subgraph polytopes
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
- The traveling salesman problem in graphs with some excluded minors
- The traveling salesman problem on a graph and some related integer polyhedra
- The traveling salesman problem: An update of research
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Topology of series-parallel networks
- Two-edge connected spanning subgraphs and polyhedra
Cited in
(43)- The box-TDI system associated with 2-edge connected spanning subgraphs
- The Steiner tree polytope and related polyhedra
- Arborescence polytopes for series-parallel graphs
- Two-edge connected spanning subgraphs and polyhedra
- 2-connected spanning subgraphs of planar 3-connected graphs
- On perfectly two-edge connected graphs
- On the two-connected planar spanning subgraph polytope
- The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points.
- On survivable network polyhedra
- Generalized network design problems.
- 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
- Separation of partition inequalities with terminals
- Spanning cactus: complexity and extensions
- The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation
- k-edge connected polyhedra on series-parallel graphs
- The 2-edge-connected subgraph polyhedron
- Critical extreme points of the 2-edge connected spanning subgraph polytope
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
- Box-total dual integrality and edge-connectivity
- Minimum cost k edges connected subgraph problems
- Survivability in hierarchical telecommunications networks
- Survivability in hierarchical telecommunications networks under dual homing
- Facet generating techniques
- A branch-and-cut algorithm for the k-edge connected subgraph problem
- A branch-and-cut algorithm for two-level survivable network design problems
- Minimum 2-edge connected spanning subgraph of certain graphs
- On the Steiner 2-edge connected subgraph polytope
- Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems
- Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs
- A network design problem with two-edge matching failures
- Optimization in telecommunication networks
- On the connected spanning cubic subgraph problem
- scientific article; zbMATH DE number 2226729 (Why is no real title available?)
- Minimum-weight two-connected spanning networks
- On the dominant of the Steiner 2-edge connected subgraph polytope
- Design of survivable networks with low connectivity requirements
- A branch-and-cut algorithm for the multiple Steiner TSP with order constraints
- Extended formulation and branch-and-cut-and-price algorithm for the two connected subgraph problem with disjunctive constraints
- Solution approaches to the three-index assignment problem
- On the connected blocks polytope
- Design of survivable IP-over-optical networks
This page was built for publication: Two-edge connected spanning subgraphs and polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1330901)
