Dynamic traveling repair problem with an arbitrary time window
From MaRDI portal
Recommendations
- On-line algorithms for the dynamic traveling repair problem
- News from the online traveling repairman.
- scientific article; zbMATH DE number 1834671
- Special cases of traveling salesman and repairman problems with time windows
- An improved online algorithm for the traveling repairperson problem on a line
Cites work
- 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Algorithms for the on-line travelling salesman
- Approximating a vehicle scheduling problem with time windows and handling times
- Approximation algorithms for deadline-TSP and vehicle routing with time-windows
- Approximation Algorithms for Orienteering and Discounted-Reward TSP
- Approximation and Online Algorithms
- Buffer management for colored packets with deadlines
- scientific article; zbMATH DE number 4047423 (Why is no real title available?)
- Improved algorithms for orienteering and related problems
- New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
- On approximating a geometric prize-collecting traveling salesman problem with time windows
- On-line algorithms for the dynamic traveling repair problem
- On-line single-server dial-a-ride problems
- Online traveling salesman problems with rejection options
- Special cases of traveling salesman and repairman problems with time windows
- The orienteering problem
Cited in
(2)
This page was built for publication: Dynamic traveling repair problem with an arbitrary time window
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2971153)
