The A priori traveling repairman problem

DOI10.1007/s00453-017-0351-zzbMath1402.90162OpenAlexW2741682221WikidataQ59515176 ScholiaQ59515176MaRDI QIDQ722527

Martijn van Ee, R. A. Sitters

Publication date: 26 July 2018

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-017-0351-z

zbMATH Keywords

approximation algorithmsa priori optimizationtraveling repairman problem

Mathematics Subject Classification ID

Stochastic programming (90C15) Combinatorial optimization (90C27)

Related Items (4)

Stochastic hub location problems with Bernoulli demands ⋮ Approximation algorithms for the a priori traveling repairman ⋮ A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits ⋮ A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands

Cites Work

• Unnamed Item
• Unnamed Item
• Deterministic sampling algorithms for network design
• Algorithms for the universal and a priori TSP
• An improved approximation ratio for the minimum latency problem
• Primal-dual algorithms for connected facility location problems
• Connected facility location via random facility sampling and core detouring
• The minimum latency problem
• The Design of Approximation Algorithms
• Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems
• Routing Under Uncertainty: The a priori Traveling Repairman Problem
• A Constant Approximation Algorithm for the a priori Traveling Salesman Problem
• Improved Lower Bounds for the Universal and a priori TSP
• The complexity of the travelling repairman problem
• P-Complete Approximation Problems
• A General Approximation Technique for Constrained Forest Problems
• Polynomial time approximation schemes for the traveling repairman and other minimum latency problems.

This page was built for publication: The A priori traveling repairman problem