Pages that link to "Item:Q2920753"
From MaRDI portal
The following pages link to Approximation algorithms for network design problems (Q2920753):
Displaying 12 items.
- Deterministic sampling algorithms for network design (Q547282) (← links)
- Approximation algorithms for data management in networks (Q1879189) (← links)
- Approximation algorithms for a capacitated network design problem (Q1879243) (← links)
- Algorithms for the non-bifurcated network design problem (Q2271128) (← links)
- Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm (Q2429332) (← links)
- A 2-approximation algorithm for the network substitution problem (Q2583715) (← links)
- An improved approximation algorithm for virtual private network design (Q2921760) (← links)
- Complexity and Approximation of the Continuous Network Design Problem (Q2969620) (← links)
- (Q3128880) (← links)
- Acceleration of cutting-plane and column generation algorithms: Applications to network design (Q3418117) (← links)
- Algorithms for a network design problem with crossing supermodular demands (Q4474300) (← links)
- Algorithms and extended formulations for one and two facility network design (Q4645912) (← links)