Minimizing latency of capacitated \(k\)-tours

DOI10.1007/s00453-017-0337-xzbMath1402.90153OpenAlexW2658712968MaRDI QIDQ724250

Christopher S. Martin, Mohammad R. Salavatipour

Publication date: 25 July 2018

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-017-0337-x

zbMATH Keywords

approximationlatencycapacitated\(k\)-travelling repairmengroup coverage

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heuristics for unequal weight delivery problems with a fixed error guarantee
• An improved approximation ratio for the minimum latency problem
• Pipage rounding: a new method of constructing algorithms with proven performance guarantee
• A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem
• A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
• The minimum latency problem
• Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems
• Randomized metarounding (extended abstract)
• Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
• A Faster, Better Approximation Algorithm for the Minimum Latency Problem
• Bounds and Heuristics for Capacitated Routing Problems
• Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
• Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Linear Programming-based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems (Extended Abstract)