Pages that link to "Item:Q3116635"
From MaRDI portal
The following pages link to Design of Communication Networks with Survivability Constraints (Q3116635):
Displaying 18 items.
- The multi-terminal maximum-flow network-interdiction problem (Q713097) (← links)
- An efficient link allocation algorithm for survivable ATM-based personal communication networks (Q960414) (← links)
- Network survivability modeling (Q1018878) (← links)
- Design of partially survivable networks for cellular telecommunication systems (Q1307809) (← links)
- A cutting plane algorithm for computing \(k\)-edge survivability of a network (Q1877897) (← links)
- Network synthesis under survivability constraints (Q1878995) (← links)
- Multiobjective design of survivable IP networks (Q2379874) (← links)
- Survivable network design under optimal and heuristic interdiction scenarios (Q2460119) (← links)
- Designing least-cost survivable wireless backhaul networks (Q2567895) (← links)
- Minimum<i>k</i>-geodetically connected digraphs (Q3157033) (← links)
- An approach to robust network design in telecommunications (Q3515394) (← links)
- Connectivity-splitting models for survivable network design (Q4446914) (← links)
- Low-connectivity network design on series-parallel graphs (Q4474292) (← links)
- Towards minimum<i>k</i>-geodetically connected graphs (Q4804165) (← links)
- Connectivity Upgrade Models for Survivable Network Design (Q5188992) (← links)
- Multi-period maintenance scheduling of tree networks with minimum flow disruption (Q5198690) (← links)
- Resilience of communication networks to random failures and disasters: An optimization perspective (Q6066054) (← links)
- Design of survivable wireless backhaul networks with reliability considerations (Q6164320) (← links)
