On approximating a geometric prize-collecting traveling salesman problem with time windows

DOI10.1016/J.JALGOR.2003.11.002zbMATH Open1066.90098OpenAlexW2072592433MaRDI QIDQ4675490FDOQ4675490

Authors: Guy Even, Shimon (Moni) Shahar, Reuven Bar-Yehuda 

Publication date: 4 May 2005

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgor.2003.11.002

Recommendations

• On approximating a geometric prize-collecting traveling salesman problem with time windows (extended abstract)
• Special cases of traveling salesman and repairman problems with time windows
• Approximating a vehicle scheduling problem with time windows and handling times
• Approximation algorithms for the traveling repairman and speeding deliveryman problems
• Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows

zbMATH Keywords

dynamic programming algorithmscheduling problemtraveling salesmanlocations

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Dynamic programming (90C39)

Cited In (11)

• The orienteering problem with time windows applied to robotic melon harvesting
• The orienteering problem: a survey
• Dynamic traveling repair problem with an arbitrary time window
• Approximation algorithms for the traveling repairman and speeding deliveryman problems
• On approximating a geometric prize-collecting traveling salesman problem with time windows (extended abstract)
• Approximating a vehicle scheduling problem with time windows and handling times
• Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows
• Special cases of traveling salesman and repairman problems with time windows
• Iterated local search for the team orienteering problem with time windows
• Spider covers and their applications
• Multi-period orienteering with uncertain adoption likelihood and waiting at customers

This page was built for publication: On approximating a geometric prize-collecting traveling salesman problem with time windows

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