Pages that link to "Item:Q1698886"
From MaRDI portal
The following pages link to Design of survivable networks with vulnerability constraints (Q1698886):
Displaying 19 items.
- Designing survivable networks with zero-suppressed binary decision diagrams (Q782194) (← links)
- Hop-constrained node survivable network design: An application to MPLS over WDM (Q1035728) (← links)
- Hop constrained network design problem with partial survivability (Q1599306) (← links)
- Branch-and-cut methods for the network design problem with vulnerability constraints (Q1652559) (← links)
- Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem (Q1683126) (← links)
- Stochastic survivable network design problems: theory and practice (Q1752199) (← links)
- Efficient methods for the distance-based critical node detection problem in complex networks (Q2668688) (← links)
- On the complexity of resilient network design (Q3057137) (← links)
- (Q3476566) (← links)
- Price of Stability in Survivable Network Design (Q3648856) (← links)
- Connectivity-splitting models for survivable network design (Q4446914) (← links)
- Constrained length connectivity and survivable networks (Q4509380) (← links)
- Online and Stochastic Survivable Network Design (Q4910579) (← links)
- On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints (Q5139851) (← links)
- Graph fragmentation problem: analysis and synthesis (Q6066278) (← links)
- Network design with vulnerability constraints and probabilistic edge reliability (Q6599059) (← links)
- A computational study on integer programming formulations for hop-constrained survivable network design (Q6657263) (← links)
- Design of survivable networks with low connectivity requirements (Q6659118) (← links)
