@article{1e4e27b8d2d14cc491ed6b491efa2811,
title = "The single line moving target traveling salesman problem with release times",
abstract = "We define and study a variant of the Moving Target Traveling Salesman Problem, with all targets confined to a line and moving at the same speed. Target may appear at different times and the agent{\textquoteright}s (salesman{\textquoteright}s) objective is to intercept all targets in a minimum of time. We present a polynomial time algorithm to solve this problem.",
keywords = "Dynamic programing, Moving target, Release times, Traveling salesman problem",
author = "Michael Hassoun and Shraga Shoval and Eran Simchon and Liron Yedidsion",
note = "Publisher Copyright: {\textcopyright} 2019, Springer Science+Business Media, LLC, part of Springer Nature.",
year = "2020",
month = jun,
day = "1",
doi = "10.1007/s10479-019-03412-x",
language = "אנגלית",
volume = "289",
pages = "449--458",
journal = "Annals of Operations Research",
issn = "0254-5330",
publisher = "Springer Netherlands",
number = "2",
}