Pages that link to "Item:Q1849257"
From MaRDI portal
The following pages link to Polyhedral results for two-connected networks with bounded rings (Q1849257):
Displaying 7 items.
- 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)
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints (Q5139851) (← links)
- A Network Design Problem with Two-Edge Matching Failures (Q5247694) (← links)
- A branch‐and‐cut algorithm for the ring spur assignment problem (Q5326781) (← links)
- Network design with vulnerability constraints and probabilistic edge reliability (Q6599059) (← links)