Pages that link to "Item:Q1879243"
From MaRDI portal
The following pages link to Approximation algorithms for a capacitated network design problem (Q1879243):
Displaying 4 items.
- On the approximation of the generalized capacitated tree-routing problem (Q988692) (← links)
- Approximation algorithms for soft-capacitated facility location in capacitated network design (Q1024778) (← links)
- Approximating the \(k\)-splittable capacitated network design problem (Q1751198) (← links)
- Approximation algorithms for solving the line-capacitated minimum Steiner tree problem (Q2089871) (← links)
