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

DOI10.1007/978-3-319-18263-6_21zbMATH Open1457.90136OpenAlexW2232996153MaRDI QIDQ3453299FDOQ3453299

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

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

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)

Cites Work

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

Cited In (5)

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

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)