[1] Ausiello G, Feuerstein E, Leonardi S, et al. Algorithms for the on-line traveling salesman 1[J]. Algorithmica, 2001, 29(4): 560-581. [2] Lipmann M. The online traveling salesman problem on the line[D]. Amsterdam,Netherlands:University of Amsterdam, 1999. [3] Blom M, Krumke S O, De-Paepe W E, etal. The online-TSP against fair adversaries[J]. Informs Journal on Computing, 2001, 13(2): 138-148. [4] Frieze M, Galbiati G, Maffioli F. On the worst-case performance of some algorithm for the asymmetric traveling salesman problem[J]. Networks, 2010, 12(1): 23-39. [5] Blaser M. A new approximation algorithm for the asymmetric TSP with triangle inequality[J]. Acm Transactions on Algorithms, 2008, 4(4): 1-15. [6] Kaplan H, Lewenstein M, Shafrir N, et al. Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs[J]. Journal of the Acm, 2005, 52(4): 602-626. [7] 徐寅峰,张惠丽,余海燕,张文明.基于方格路网的两车应急救援路径在线选择[J].系统工程理论与实践,2013,33(1):175-180. [8] 吴腾宇,徐寅峰.带有配额的在线Nomadic旅行商问题[J].运筹与管理,2016,25(2):1-6. [9] 吴腾宇,余海燕.带有线性惩罚的在线旅行商问题[J].计算机集成制造系统,2017,23(4):913-920. [10] 马军平,徐寅峰,温新刚,张惠丽.带有预知信息的在线Homing ATSP问题[J].系统工程理论与实践,2015,35(2):381-387. [11] 马军平,徐寅峰,陈聪,吴腾宇.具有服务时长的在线TSP问题[J].系统工程理论与实践,2015,35(11):2832-2839. |