Optimal deterministic algorithms for some variants of Online Quota Traveling Salesman Problem
Authors:
- Wei YuWYWei Yu
- Zhaohui LiuZLZhaohui Liu
- Xiaoguang BaoXBXiaoguang Bao
- 1 November 2014
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 238 (3) , 735-740
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- The orienteering problem: A surveyEuropean Journal of Operational Research, 2011
- The online Prize-Collecting Traveling Salesman ProblemInformation Processing Letters, 2008
- The on-line asymmetric traveling salesman problemJournal of Discrete Algorithms, 2008
- Algorithms for the On-Line Quota Traveling Salesman ProblemInformation Processing Letters, 2004
- Paths, trees, and minimum latency tours2004
- The Online TSP Against Fair AdversariesINFORMS Journal on Computing, 2001
- Algorithms for the On-Line Travelling Salesman1Algorithmica, 2001
- Online Dial-a-Ride Problems: Minimizing the Completion Time2000
- On Salesmen, Repairmen, Spiders, and Other Traveling Agents2000
- New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting SalesmenSIAM Journal on Computing, 1998