The following pages link to (Q3129923):
Displaying 7 items.
- Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications (Q849632) (← links)
- Budget constrained minimum cost connected medians (Q876728) (← links)
- Visiting a network of services with time constraints. (Q1413815) (← links)
- Competitive algorithms for the bicriteria \(k\)-server problem (Q2433801) (← links)
- A Call-Routing Problem with Service-Level Constraints (Q3635189) (← links)
- Subgradient Methods for the Service Network Design Problem (Q4319316) (← links)
- The Continuous-Time Service Network Design Problem (Q4598647) (← links)