On approximating a geometric prize-collecting traveling salesman problem with time windows
From MaRDI portal
Publication:4675490
DOI10.1016/j.jalgor.2003.11.002zbMath1066.90098MaRDI QIDQ4675490
Shimon (Moni) Shahar, Guy Even, 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
90B35: Deterministic scheduling theory in operations research
90C27: Combinatorial optimization
90C39: Dynamic programming
Related Items
The orienteering problem with time windows applied to robotic melon harvesting, The orienteering problem: a survey, 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, Approximation algorithms for the traveling repairman and speeding deliveryman problems, Approximating a vehicle scheduling problem with time windows and handling times, Dynamic Traveling Repair Problem with an Arbitrary Time Window