Routing under uncertainty: the \textit{a priori} traveling repairman problem

DOI10.1007/978-3-319-18263-6_21MaRDI QIDQ3453299zbMATHOpenAlexFDO

Authors Martijn van Ee, René 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

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

Recommendations

• The A priori traveling repairman problem
• Approximation algorithms for the a priori traveling repairman
• A Constant Approximation Algorithm for the a priori Traveling Salesman Problem
• A Priori Optimization
• A priori TSP in the scenario model

Cites work

• scientific article; zbMATH DE number 2086925 (Why is no real title available?)
• A Constant Approximation Algorithm for the a priori Traveling Salesman Problem
• A General Approximation Technique for Constrained Forest Problems
• Algorithms for the universal and a priori TSP
• An improved approximation ratio for the minimum latency problem
• Connected facility location via random facility sampling and core detouring
• Deterministic sampling algorithms for network design
• Improved lower bounds for the universal and a priori TSP
• P-Complete Approximation Problems
• Polynomial time approximation schemes for the traveling repairman and other minimum latency problems.
• Primal-dual algorithms for connected facility location problems
• The complexity of the travelling repairman problem
• The design of approximation algorithms
• The minimum latency problem
• Worst-case analysis of a new heuristic for the travelling salesman problem

Cited in

(6)

• The median routing problem for simultaneous planning of emergency response and non-emergency jobs
• The machine learning and traveling repairman problem
• The A priori traveling repairman problem
• The risk-averse traveling repairman problem with profits
• Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios
• Approximation algorithms for the a priori traveling repairman

This page was built for publication: Routing under uncertainty: the \textit{a priori} traveling repairman problem

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