Pages that link to "Item:Q4530666"
From MaRDI portal
The following pages link to Solving the Two-Connected Network with Bounded Meshes Problem (Q4530666):
Displayed 12 items.
- Optimal capacitated ring trees (Q286687) (← links)
- Hierarchical survivable network design problems (Q325448) (← links)
- A branch-and-cut algorithm for two-level survivable network design problems (Q342262) (← links)
- The \(k\) edge-disjoint 3-hop-constrained paths polytope (Q429666) (← links)
- A primal partitioning approach for single and non-simultaneous multicommodity flow problems (Q1569942) (← 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)
- Survivability in hierarchical telecommunications networks (Q2892145) (← links)
- Analysis of Optimal Sets of Survivable Paths in Undirected Simple Graph Applicable for Optical Networks (Q3439300) (← links)
- A decomposition algorithm for the ring spur assignment problem (Q4921258) (← links)
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints (Q5139851) (← links)
- A branch‐and‐cut algorithm for the ring spur assignment problem (Q5326781) (← links)