Pages that link to "Item:Q4962679"
From MaRDI portal
The following pages link to The <i>k</i> -traveling repairmen problem (Q4962679):
Displaying 14 items.
- The multi-vehicle cumulative covering tour problem (Q1686527) (← links)
- Minimizing customers' waiting time in a vehicle routing problem with unit demands (Q1742415) (← links)
- A simple and effective metaheuristic for the minimum latency problem (Q1926884) (← links)
- The multi-depot \(k\)-traveling repairman problem (Q2091220) (← links)
- Solving the traveling delivery person problem with limited computational time (Q2103948) (← links)
- The arc-item-load and related formulations for the cumulative vehicle routing problem (Q2172084) (← links)
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network (Q2197321) (← links)
- Hybrid evolutionary search for the traveling repairman problem with profits (Q2224863) (← 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)
- A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits (Q2289922) (← links)
- Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications (Q2420657) (← links)
- Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND (Q6070871) (← links)
- An iterated local search algorithm for latency vehicle routing problems with multiple depots (Q6106601) (← links)
