Approximation algorithms for deadline-TSP and vehicle routing with time-windows
From MaRDI portal
(Redirected from Publication:3580966)
Recommendations
Cited in
(50)- Discounted reward TSP
- Tour recommendation for groups
- Approximation algorithms for time-dependent orienteering.
- Spider covers and their applications
- The online food delivery problem on stars
- Approximation algorithms for some extensions of the maximum profit routing problem
- Faster algorithms for orienteering and \(k\)-TSP
- Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems
- Delivery route optimization with automated vehicle in smart urban environment
- An approximation algorithm for vehicle routing with compatibility constraints
- Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems
- Adversarial patrolling with spatially uncertain alarm signals
- Orienteering for electioneering
- Pruning 2-connected graphs
- Approximation algorithms for the traveling repairman and speeding deliveryman problems
- Complexity and approximation for traveling salesman problems with profits
- The parameterized approximability of TSP with deadlines
- Grasp and delivery for moving objects on broken lines
- Approximating a vehicle scheduling problem with time windows and handling times
- The orienteering problem with time windows applied to robotic melon harvesting
- The multiple TSP with time windows: vehicle bounds based on precedence graphs
- A bicriteria approximation algorithm for DVRP with time windows
- Dynamic traveling repair problem with an arbitrary time window
- TSP race: minimizing completion time in time-sensitive applications
- Approximation schemes for Euclidean vehicle routing problems with time windows
- Minimum Vehicle Routing with a Common Deadline
- Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems
- The school bus problem on trees
- The capacitated orienteering problem
- The robot routing problem for collecting aggregate stochastic rewards
- Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
- The directed orienteering problem
- scientific article; zbMATH DE number 7053373 (Why is no real title available?)
- Deadline TSP
- New approximation algorithms for the rooted budgeted cycle cover problem
- Deadline TSP
- New approximation algorithms for the rooted budgeted cycle cover problem
- Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows
- Scheduling on a graph with release times
- Vehicle routing with time-dependent travel times: theory, practice, and benchmarks
- Simple heuristics for the rooted max tree coverage problem
- Earliest deadline first is a 2-approximation for DARP with time windows
- Approximation algorithms for correlated knapsack orienteering
- Online time-windows TSP with predictions
- A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
- A survey on the traveling salesman problem and its variants in a warehousing context
- Constant-factor approximation to deadline TSP and related problems in (almost) quasi-polytime
- Approximation schemes for orienteering and deadline TSP in doubling metrics
- Set covering in fuel-considered vehicle routing problems
- On the adaptivity gap of stochastic orienteering
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)
