Routing Under Uncertainty: The a priori Traveling Repairman Problem

DOI10.1007/978-3-319-18263-6_21zbMath1457.90136OpenAlexW2232996153MaRDI QIDQ3453299

Martijn van Ee, R. A. Sitters

Publication date: 20 November 2015

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18263-6_21

zbMATH Keywords

approximation algorithmsa priori optimizationtraveling repairman problem

Mathematics Subject Classification ID

Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (3)

The median routing problem for simultaneous planning of emergency response and non-emergency jobs ⋮ The A priori traveling repairman problem ⋮ Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios

Cites Work

• 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
• Worst-case analysis of a new heuristic for the travelling salesman problem
• The minimum latency problem
• The Design of Approximation Algorithms
• 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: Routing Under Uncertainty: The a priori Traveling Repairman Problem