Pages that link to "Item:Q342080"
From MaRDI portal
The following pages link to On the hop-constrained survivable network design problem with reliable edges (Q342080):
Displaying 10 items.
- Hop-constrained node survivable network design: An application to MPLS over WDM (Q1035728) (← links)
- Hop constrained network design problem with partial survivability (Q1599306) (← links)
- Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
- Design of survivable networks with vulnerability constraints (Q1698886) (← links)
- Chance‐constrained multi‐terminal network design problems (Q4632888) (← links)
- On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
- A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints (Q6066244) (← links)
- Integrated reinforcement and repair of interdependent infrastructure networks under disaster-related uncertainties (Q6167421) (← links)
- A new linear path pair availability constraint for network design (Q6599069) (← links)
- A computational study on integer programming formulations for hop-constrained survivable network design (Q6657263) (← links)