Pages that link to "Item:Q1879243"
From MaRDI portal
The following pages link to Approximation algorithms for a capacitated network design problem (Q1879243):
Displaying 11 items.
- Approximating capacitated tree-routings in networks (Q630195) (← links)
- 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)
- Approximation Schemes for Capacitated Geometric Network Design (Q3012789) (← links)
- Risk Based Optimization of Electronics Manufacturing Supply Chains (Q3299237) (← links)
- Approximating the Generalized Capacitated Tree-Routing Problem (Q3511374) (← links)
- Approximation Schemes for Capacitated Geometric Network Design (Q4556954) (← links)
- Exact Approaches for Designing Multifacility Buy-at-Bulk Networks (Q5131690) (← links)
- Approximation to the Minimum Cost Edge Installation Problem (Q5387765) (← links)
