Pages that link to "Item:Q5326786"
From MaRDI portal
The following pages link to Hop‐level flow formulation for the survivable network design with hop constraints problem (Q5326786):
Displayed 10 items.
- Robust combinatorial optimization with variable cost uncertainty (Q296586) (← links)
- Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
- Branch-and-cut methods for the network design problem with vulnerability constraints (Q1652559) (← links)
- Design of survivable networks with vulnerability constraints (Q1698886) (← links)
- On the chance-constrained minimum spanning \(k\)-core problem (Q2274857) (← links)
- The two-level diameter constrained spanning tree problem (Q2340278) (← links)
- Efficient methods for the distance-based critical node detection problem in complex networks (Q2668688) (← links)
- The Minimum Spanning <i>k</i>-Core Problem with Bounded CVaR Under Probabilistic Edge Failures (Q3186660) (← links)
- Distance Transformation for Network Design Problems (Q5231681) (← links)
- A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints (Q6066244) (← links)