Approximating the \(k\)-traveling repairman problem with repair times

DOI10.1016/j.jda.2006.03.023zbMath1122.90086OpenAlexW2084774860MaRDI QIDQ2457300

Raja Jothi, Balaji Raghavachari

Publication date: 30 October 2007

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.03.023

zbMATH Keywords

combinatorial optimizationapproximation algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (10)

Approximation algorithms for distance constrained vehicle routing problems ⋮ Maintenance scheduling of geographically distributed assets with prognostics information ⋮ Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem ⋮ The arc-item-load and related formulations for the cumulative vehicle routing problem ⋮ Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems ⋮ Vehicle routing with subtours ⋮ A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem ⋮ Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems ⋮ The multi-depot \(k\)-traveling repairman problem ⋮ A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem

Cites Work

• The delivery man problem on a tree network
• The minimum latency problem
• Saving an epsilon
• P-Complete Approximation Problems
• The Delivery Man Problem and Cumulative Matroids
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• LATIN 2004: Theoretical Informatics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximating the \(k\)-traveling repairman problem with repair times