Pages that link to "Item:Q5318274"
From MaRDI portal
The following pages link to Design of Survivable Networks: A survey (Q5318274):
Displayed 17 items.
- New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← links)
- Solving survivable two-layer network design problems by metric inequalities (Q429456) (← links)
- The \(k\) edge-disjoint 3-hop-constrained paths polytope (Q429666) (← links)
- New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (Q709141) (← links)
- Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron (Q839668) (← links)
- The \(k\)-path tree matroid and its applications to survivable network design (Q951105) (← links)
- A global optimization algorithm for reliable network design (Q2379515) (← links)
- Critical extreme points of the 2-edge connected spanning subgraph polytope (Q2583127) (← links)
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut (Q2583145) (← links)
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice (Q2638387) (← links)
- Strong Lower Bounds for a Survivable Network Design Problem (Q2883576) (← links)
- Survivability in hierarchical telecommunications networks (Q2892145) (← links)
- A branch-and-cut algorithm for the k-edge connected subgraph problem (Q3057129) (← links)
- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation (Q3057155) (← links)
- On the Steiner 2-edge connected subgraph polytope (Q3598034) (← links)
- Strong Formulations for 2-Node-Connected Steiner Network Problems (Q5505657) (← links)
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (Q5892561) (← links)