Pages that link to "Item:Q2892145"
From MaRDI portal
The following pages link to Survivability in hierarchical telecommunications networks (Q2892145):
Displaying 5 items.
- A branch-and-cut algorithm for two-level survivable network design problems (Q342262) (← links)
- Time constrained maximal covering salesman problem with weighted demands and partial coverage (Q342578) (← links)
- Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
- Survivability in Hierarchical Telecommunications Networks Under Dual Homing (Q2967611) (← links)
- A survivable variant of the ring star problem (Q6196876) (← links)
