Pages that link to "Item:Q3009753"
From MaRDI portal
The following pages link to Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems (Q3009753):
Displaying 12 items.
- The latency location-routing problem (Q323569) (← links)
- Minimizing latency of capacitated \(k\)-tours (Q724250) (← links)
- A constant-factor approximation for directed latency in quasi-polynomial time (Q2119400) (← links)
- Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems (Q2164695) (← links)
- A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2514732) (← links)
- Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems (Q3009753) (← links)
- (Q3186531) (redirect page) (← links)
- A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case (Q5096584) (← links)
- (Q5111735) (← links)
- A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time (Q5874522) (← links)
- On the cost of essentially fair clusterings (Q5875470) (← links)
- On coresets for fair clustering in metric and Euclidean spaces and their applications (Q6152182) (← links)
