The k -traveling repairmen problem
From MaRDI portal
Publication:4962679
DOI10.1145/1290672.1290677zbMath1446.90133OpenAlexW2062962786MaRDI QIDQ4962679
No author found.
Publication date: 5 November 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1290672.1290677
Related Items
The arc-item-load and related formulations for the cumulative vehicle routing problem ⋮ A simple and effective metaheuristic for the minimum latency problem ⋮ The multi-vehicle cumulative covering tour problem ⋮ Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND ⋮ Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications ⋮ An iterated local search algorithm for latency vehicle routing problems with multiple depots ⋮ Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network ⋮ Hybrid evolutionary search for the traveling repairman problem with profits ⋮ Variable neighborhood search based algorithms to solve a rich \(k\)-travelling repairmen problem ⋮ Minimizing customers' waiting time in a vehicle routing problem with unit demands ⋮ Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints ⋮ A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits ⋮ The multi-depot \(k\)-traveling repairman problem ⋮ Solving the traveling delivery person problem with limited computational time
This page was built for publication: The k -traveling repairmen problem
