Online Traveling Salesman Problems with Flexibility
暂无分享,去创建一个
[1] S. Albers. Competitive Online Algorithms , 1996 .
[2] Leen Stougie,et al. Algorithms for the On-Line Travelling Salesman1 , 2001, Algorithmica.
[3] Bala Kalyanasundaram,et al. Constructing Competitive Tours from Local Information , 1994, Theor. Comput. Sci..
[4] Leen Stougie,et al. The Online-TSP against Fair Adversaries , 2000, CIAC.
[5] Martin W. P. Savelsbergh,et al. Competitive analysis for dynamic multiperiod uncapacitated routing problems , 2007 .
[6] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[7] Martin W. P. Savelsbergh,et al. Competitive analysis of a dispatch policy for a dynamic multi-period routing problem , 2007, Oper. Res. Lett..
[8] Sven Oliver Krumke,et al. Online Dial-a-Ride Problems: Minimizing the Completion Time , 2000, STACS.
[9] Jens Vygen,et al. The Book Review Column1 , 2020, SIGACT News.
[10] Patrick Jaillet,et al. Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses , 2008, Oper. Res..
[11] Leen Stougie,et al. On-line single-server dial-a-ride problems , 2001, Theor. Comput. Sci..
[12] Anna R. Karlin,et al. Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[13] Giorgio Ausiello,et al. On the Power of Lookahead in On-Line Vehicle Routing Problems , 2005, COCOON.
[14] Patrick Jaillet,et al. Online traveling salesman problems with service flexibility , 2011, Networks.
[15] Eugene L. Lawler,et al. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .
[16] Gerhard J. Woeginger,et al. Developments from a June 1996 seminar on Online algorithms: the state of the art , 1998 .
[17] Vangelis Th. Paschos,et al. Algorithms for the On-Line Quota Traveling Salesman Problem , 2004, Inf. Process. Lett..
[18] Patrick Jaillet,et al. Online Routing Problems: Value of Advanced Information as Improved Competitive Ratios , 2006, Transp. Sci..
[19] M Maarten Lipmann,et al. On-line routing , 2003 .
[20] Giorgio Ausiello,et al. The online Prize-Collecting Traveling Salesman Problem , 2008, Inf. Process. Lett..
[21] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.