The following pages link to (Q5417636):
Displaying 12 items.
- Minimizing latency of capacitated \(k\)-tours (Q724250) (← links)
- A branch-and-price algorithm for the minimum latency problem (Q1652580) (← links)
- The multi-vehicle cumulative covering tour problem (Q1686527) (← links)
- A simple and effective metaheuristic for the minimum latency problem (Q1926884) (← links)
- Solving the traveling delivery person problem with limited computational time (Q2103948) (← links)
- An adaptive large neighborhood search approach for multiple traveling repairman problem with profits (Q2273692) (← links)
- A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits (Q2289922) (← links)
- Visiting infinitely often the unit interval while minimizing the idle time of high priority segments (Q2303307) (← links)
- On combining machine learning with decision making (Q2512894) (← links)
- An Improved Online Algorithm for the Traveling Repairperson Problem on a Line (Q5092364) (← links)
- Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems (Q5860477) (← links)
- Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining (Q6070880) (← links)
