Pages that link to "Item:Q1878995"
From MaRDI portal
The following pages link to Network synthesis under survivability constraints (Q1878995):
Displaying 17 items.
- Designing survivable networks with zero-suppressed binary decision diagrams (Q782194) (← links)
- Network survivability modeling (Q1018878) (← links)
- Large scale linear programs and heuristics for the design of survivable telecommunication networks (Q1417789) (← links)
- Network synthesis problems (Q1592496) (← links)
- ``Selfish'' algorithm for reducing the computational cost of the network survivability analysis (Q2357208) (← links)
- Complexity of a classical flow restoration problem (Q2811305) (← links)
- Complexity of column generation in network design with path-based survivability mechanisms (Q2892152) (← links)
- Survivability in Hierarchical Telecommunications Networks Under Dual Homing (Q2967611) (← links)
- (Q3017635) (← links)
- On the complexity of resilient network design (Q3057137) (← links)
- Optimal routing with failure-independent path protection (Q3057139) (← links)
- Design of Communication Networks with Survivability Constraints (Q3116635) (← links)
- Survivable capacitated network design problem: new formulation and Lagrangean relaxation (Q3156578) (← links)
- Survivable green traffic engineering with shared protection (Q4565768) (← links)
- (Q4712671) (← links)
- (Q5323944) (← links)
- Using a hybrid of exact and genetic algorithms to design survivable networks (Q5955471) (← links)