On approximating a geometric prize-collecting traveling salesman problem with time windows
From MaRDI portal
Publication:4675490
DOI10.1016/j.jalgor.2003.11.002zbMath1066.90098OpenAlexW2072592433MaRDI 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
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Dynamic programming (90C39)
Related Items (8)
Iterated local search for the team orienteering problem with time windows ⋮ The orienteering problem: a survey ⋮ Spider covers and their applications ⋮ Approximation algorithms for the traveling repairman and speeding deliveryman problems ⋮ Dynamic Traveling Repair Problem with an Arbitrary Time Window ⋮ Approximating a vehicle scheduling problem with time windows and handling times ⋮ Multi-period orienteering with uncertain adoption likelihood and waiting at customers ⋮ The orienteering problem with time windows applied to robotic melon harvesting
This page was built for publication: On approximating a geometric prize-collecting traveling salesman problem with time windows
