Pages that link to "Item:Q2892145"
From MaRDI portal
The following pages link to Survivability in hierarchical telecommunications networks (Q2892145):
Displaying 13 items.
- Hierarchical survivable network design problems (Q325448) (← links)
- 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)
- Approximation algorithm for optimal location of concentrators and design of capacitated survivable backbone networks (Q622809) (← links)
- Design of partially survivable networks for cellular telecommunication systems (Q1307809) (← links)
- Investigation of the survivability of a hierarchical network (Q1860520) (← links)
- Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
- Survivability in Hierarchical Telecommunications Networks Under Dual Homing (Q2967611) (← links)
- Telecommunication Node Clustering with Node Compatibility and Network Survivability Requirements (Q3116739) (← links)
- (Q5323944) (← links)
- Resilience of communication networks to random failures and disasters: An optimization perspective (Q6066054) (← links)
- A survivable variant of the ring star problem (Q6196876) (← links)
- Design of survivable networks with low connectivity requirements (Q6659118) (← links)