The following pages link to The minimum latency problem (Q2817608):
Displayed 18 items.
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem (Q548680) (← links)
- Query strategies for priced information (Q696973) (← links)
- Exact algorithms for the minimum latency problem (Q834971) (← links)
- Profit-based latency problems on the line (Q943793) (← links)
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem (Q975996) (← links)
- A new formulation for the traveling deliveryman problem (Q1003469) (← links)
- An improved approximation ratio for the minimum latency problem (Q1290636) (← links)
- A constant-factor approximation algorithm for the \(k\)-MST problem (Q1305925) (← links)
- On the existence of schedules that are near-optimal for both makespan and total weighted completion time (Q1375117) (← links)
- News from the online traveling repairman. (Q1401247) (← links)
- The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices (Q1806599) (← links)
- Approximating the \(k\)-traveling repairman problem with repair times (Q2457300) (← links)
- A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem (Q2492706) (← links)
- Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems (Q3009753) (← links)
- Almost sure asymptotic optimality for online routing and machine scheduling problems (Q3057128) (← links)
- The Directed Minimum Latency Problem (Q3541796) (← links)
- Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems (Q5443715) (← links)
- On-line single-server dial-a-ride problems (Q5958715) (← links)