Pages that link to "Item:Q5326786"

The following pages link to Hop‐level flow formulation for the survivable network design with hop constraints problem (Q5326786):

Displayed 8 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)
• 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)