The following pages link to (Q2753737):
Displaying 13 items.
- A branch-and-cut algorithm for capacitated network design problems (Q1806022) (← links)
- Approximation algorithms for a capacitated network design problem (Q1879243) (← links)
- Algorithms for the non-bifurcated network design problem (Q2271128) (← links)
- A 2-approximation algorithm for the network substitution problem (Q2583715) (← links)
- Complexity and Approximation of the Continuous Network Design Problem (Q2969620) (← links)
- (Q3128880) (← links)
- Approximation Algorithms for Buy-at-Bulk Geometric Network Design (Q3183450) (← links)
- (Q3826339) (← 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)
- Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem (Q4922116) (← links)
- Approximating Capacitated Tree-Routings in Networks (Q5425447) (← links)
- Automata, Languages and Programming (Q5466515) (← links)