The following pages link to The minimum latency problem (Q2817608):
Displaying 19 items.
- Polynomial time algorithms for some minimum latency problems (Q294831) (← links)
- Maintenance scheduling of geographically distributed assets with prognostics information (Q319618) (← links)
- Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem (Q320880) (← links)
- Heuristics for the traveling repairman problem with profits (Q336352) (← links)
- The delivery man problem with time windows (Q429673) (← links)
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem (Q548680) (← links)
- Query strategies for priced information (Q696973) (← links)
- The A priori traveling repairman problem (Q722527) (← links)
- Minimizing latency of capacitated \(k\)-tours (Q724250) (← 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)
- Adaptive Submodular Ranking and Routing (Q5130512) (← links)
- An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem (Q5242274) (← links)
- Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems (Q5443715) (← links)
- A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time (Q5874522) (← links)
- Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem (Q6066728) (← links)
- Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining (Q6070880) (← links)
- An iterated local search algorithm for latency vehicle routing problems with multiple depots (Q6106601) (← links)
