Approximation Algorithms for Capacitated k-Travelling Repairmen Problems.

DOI10.4230/LIPICS.ISAAC.2016.56MaRDI QIDQ4636540zbMATH OpenOpenAlexFDO

Authors Christopher S. Martin, Mohammad Salavatipour

Publication date 19 April 2018

Full work available at URL https://dblp.uni-trier.de/db/conf/isaac/isaac2016.html#MartinS16

zbMATH Keywords

approximationlatencycapacitatedgroup coverage

Mathematics Subject Classification ID

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

Recommendations

• Approximating the \(k\)-traveling repairman problem with repair times
• Approximation algorithms for the a priori traveling repairman
• Approximation algorithms for the traveling repairman and speeding deliveryman problems
• scientific article; zbMATH DE number 2079396
• The \(k\)-traveling repairmen problem
• Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems
• Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows
• The multi-depot \(k\)-traveling repairman problem

Cited in

(4)

• LATIN 2004: Theoretical Informatics
• Polynomial formulation and heuristic based approach for the \(k\)-travelling repairman problem
• Approximating the \(k\)-traveling repairman problem with repair times
• On-line algorithms for the dynamic traveling repair problem

This page was built for publication: Approximation Algorithms for Capacitated k-Travelling Repairmen Problems.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4636540)