期刊
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC
卷 49, 期 1, 页码 153-174出版社
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/S0196-6774(03)00075-0
关键词
-
Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent generalization of TSP which we call Moving-Target TSP, where a pursuer must intercept in minimum time a set of targets which move with constant velocities. We propose approximate and exact algorithms for several natural variants of Moving-Target TSP. (C) 2003 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据