scientific article; zbMATH DE number 2079396

MaRDI QIDQ4471355zbMATH OpenFDO

Authors

Publication date 28 July 2004

Mathematics Subject Classification ID

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

Recommendations

• The \(k\)-traveling repairmen problem
• Approximating the \(k\)-traveling repairman problem with repair times
• LATIN 2004: Theoretical Informatics
• Approximation schemes for minimum latency problems
• Approximation Schemes for Minimum Latency Problems

Cited in

(26)

• A cost-time trade-off Königsberg bridge problem traversing all the seven bridges allowing repetition
• Spider covers and their applications
• The multi-depot \(k\)-traveling repairman problem
• Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems
• The arc-item-load and related formulations for the cumulative vehicle routing problem
• Comments on: ``Polynomial formulation and heuristic-based approach for the \(k\)-travelling repairman problem
• The risk-averse traveling repairman problem with profits
• A heuristic for cumulative vehicle routing using column generation
• The multiple-job repair kit problem
• Approximating the \(k\)-traveling repairman problem with repair times
• Approximation algorithms for the a priori traveling repairman
• Maintenance scheduling of geographically distributed assets with prognostics information
• A Faster, Better Approximation Algorithm for the Minimum Latency Problem
• The complexity of the travelling repairman problem
• A robust optimization approach to dispatching technicians under stochastic service times
• scientific article; zbMATH DE number 1507215 (Why is no real title available?)
• Approximation Algorithms for Capacitated k-Travelling Repairmen Problems.
• The \(k\)-traveling repairmen problem
• Approximation algorithms for stochastic k-TSP
• Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems
• LATIN 2004: Theoretical Informatics
• Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND
• Probabilistic bounds on the k-traveling salesman problem and the traveling repairman problem
• Min-max tree covers of graphs.
• Minimizing latency of capacitated \(k\)-tours
• Online k-server routing problems

This page was built for publication:

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