Pages that link to "Item:Q2091220"
From MaRDI portal
The following pages link to The multi-depot \(k\)-traveling repairman problem (Q2091220):
Displaying 13 items.
- Polynomial formulation and heuristic based approach for the \(k\)-travelling repairman problem (Q1753757) (← links)
- Comments on: ``Polynomial formulation and heuristic-based approach for the \(k\)-travelling repairman problem'' (Q2205068) (← links)
- Variable neighborhood search based algorithms to solve a rich \(k\)-travelling repairmen problem (Q2228400) (← links)
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
- Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios (Q2329723) (← links)
- The multiple-job repair kit problem (Q2433467) (← links)
- Approximating the \(k\)-traveling repairman problem with repair times (Q2457300) (← links)
- The complexity of the travelling repairman problem (Q3709900) (← links)
- Approximation Algorithms for Capacitated k-Travelling Repairmen Problems. (Q4636540) (← links)
- LATIN 2004: Theoretical Informatics (Q5901662) (← links)
- Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization (Q6073272) (← links)
- Effective metaheuristics for the latency location routing problem (Q6080614) (← links)
- An iterated local search algorithm for latency vehicle routing problems with multiple depots (Q6106601) (← links)
