Pages that link to "Item:Q3189061"
From MaRDI portal
The following pages link to Assignment problem in content distribution networks (Q3189061):
Displaying 7 items.
- New approximation algorithms for the unsplittable capacitated facility location problem (Q300454) (← links)
- Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
- Local search algorithms for the red-blue median problem (Q692631) (← links)
- Improved approximation for prize-collecting red-blue median (Q2043014) (← links)
- Euclidean prize-collecting Steiner forest (Q2429324) (← links)
- A Branch-and-Price Algorithm for Facility Location with General Facility Cost Functions (Q4995059) (← links)
- Airports and railways with unsplittable demand (Q6663529) (← links)
