Pages that link to "Item:Q2883576"
From MaRDI portal
The following pages link to Strong lower bounds for a survivable network design problem (Q2883576):
Displaying 9 items.
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems (Q316168) (← links)
- Approximating survivable networks with \(\beta \)-metric costs (Q553954) (← links)
- A hybrid optimization approach for the Steiner \(k\)-connected network design problem (Q1742248) (← links)
- Formulations for designing robust networks. An application to wind power collection (Q1742258) (← links)
- Fast Approximation Algorithms for the Generalized Survivable Network Design Problem (Q4636516) (← links)
- Distance Transformation for Network Design Problems (Q5231681) (← links)
- Stabilizing branch‐and‐price for constrained tree problems (Q5326785) (← links)
- Additive Approximation for Bounded Degree Survivable Network Design (Q5408765) (← links)
- Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems (Q5952066) (← links)
