Approximation algorithms for deadline-TSP and vehicle routing with time-windows
DOI10.1145/1007352.1007385zbMATH Open1192.90216OpenAlexW2158591664MaRDI QIDQ3580966FDOQ3580966
Authors: N. Bansal, Shuchi Chawla, Adam Meyerson, Avrim Blum 
Publication date: 15 August 2010
Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1007352.1007385
Recommendations
Programming involving graphs or networks (90C35) Approximation algorithms (68W25) Transportation, logistics and supply chain management (90B06)
Cited In (44)
- The orienteering problem with time windows applied to robotic melon harvesting
- Approximation algorithms for some extensions of the maximum profit routing problem
- Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems
- New approximation algorithms for the rooted budgeted cycle cover problem
- Dynamic traveling repair problem with an arbitrary time window
- A bicriteria approximation algorithm for DVRP with time windows
- Approximation algorithms for the traveling repairman and speeding deliveryman problems
- Tour recommendation for groups
- An approximation algorithm for vehicle routing with compatibility constraints
- Approximating a vehicle scheduling problem with time windows and handling times
- Complexity and approximation for traveling salesman problems with profits
- Faster algorithms for orienteering and \(k\)-TSP
- Pruning 2-connected graphs
- Title not available (Why is that?)
- Adversarial patrolling with spatially uncertain alarm signals
- Deadline TSP
- Vehicle routing with time-dependent travel times: theory, practice, and benchmarks
- Earliest deadline first is a 2-approximation for DARP with time windows
- Simple heuristics for the rooted max tree coverage problem
- TSP race: minimizing completion time in time-sensitive applications
- Grasp and delivery for moving objects on broken lines
- The robot routing problem for collecting aggregate stochastic rewards
- On the adaptivity gap of stochastic orienteering
- Set covering in fuel-considered vehicle routing problems
- Spider covers and their applications
- New approximation algorithms for the rooted budgeted cycle cover problem
- Scheduling on a graph with release times
- The directed orienteering problem
- Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems
- Approximation schemes for Euclidean vehicle routing problems with time windows
- Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
- Deadline TSP
- The capacitated orienteering problem
- Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems
- Minimum Vehicle Routing with a Common Deadline
- Delivery route optimization with automated vehicle in smart urban environment
- Approximation algorithms for time-dependent orienteering.
- The multiple TSP with time windows: vehicle bounds based on precedence graphs
- The online food delivery problem on stars
- The school bus problem on trees
- Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows
- Discounted reward TSP
- The parameterized approximability of TSP with deadlines
- Orienteering for electioneering
This page was built for publication: Approximation algorithms for deadline-TSP and vehicle routing with time-windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580966)
