暂无分享,去创建一个
[1] Patrick Jaillet,et al. Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses , 2008, Oper. Res..
[2] Jens Vygen,et al. Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs , 2012, ArXiv.
[3] Leen Stougie,et al. Online k-Server Routing Problems , 2008, Theory of Computing Systems.
[4] Lyle A. McGeoch,et al. Competitive Algorithms for Server Problems , 1990, J. Algorithms.
[5] Christos H. Papadimitriou,et al. On the k-server conjecture , 1995, JACM.
[6] Joseph Naor,et al. Towards the randomized k-server conjecture: a primal-dual approach , 2010, SODA '10.
[7] Michel Gendreau,et al. A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.
[8] Gilbert Laporte,et al. A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .
[9] Nicos Christofides. Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.
[10] Paolo Toth,et al. A hybrid Granular Tabu Search algorithm for the Multi-Depot Vehicle Routing Problem , 2014, J. Heuristics.
[11] Bruce L. Golden,et al. A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions , 1993 .
[12] Lyle A. McGeoch,et al. A strongly competitive randomized paging algorithm , 1991, Algorithmica.
[13] Gilbert Laporte,et al. What you should know about the vehicle routing problem , 2007 .
[14] Gilbert Laporte,et al. A tabu search heuristic for the multi-depot vehicle routing problem , 1996, Comput. Oper. Res..
[15] Moshe Dror,et al. Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems , 2007, Journal of Applied Probability.
[16] Joseph Naor,et al. A primal-dual randomized algorithm for weighted paging , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[17] Ola Svensson,et al. Approximating Graphic TSP by Matchings , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[18] Hans-Joachim Böckenhauer,et al. Improved lower bounds on the approximability of the Traveling Salesman Problem , 2000, RAIRO Theor. Informatics Appl..
[19] Gilbert Laporte,et al. Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems , 1988, Transp. Sci..
[20] T. Bektaş. The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .
[21] Erick Delage,et al. Robust Partitioning for Stochastic Multivehicle Routing , 2012, Oper. Res..
[22] Marcin Mucha. 13/9-approximation for Graphic TSP , 2012, STACS.
[23] Leen Stougie,et al. Algorithms for the On-Line Travelling Salesman1 , 2001, Algorithmica.
[24] Adi Rosén,et al. The Distributed k-Server Problem - A Competitive Distributed Translator for k-Server Algorithms , 1997, J. Algorithms.
[25] Joseph S. B. Mitchell,et al. Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems , 1999, SIAM J. Comput..
[26] John Gunnar Carlsson,et al. Dividing a Territory Among Several Vehicles , 2012, INFORMS J. Comput..
[27] I D Giosa,et al. New assignment algorithms for the multi-depot vehicle routing problem , 2002, J. Oper. Res. Soc..
[28] Francesco Bullo,et al. Gossip algorithms for heterogeneous multi-vehicle routing problems , 2013 .
[29] Manish Kumar,et al. A Market-based Solution to the Multiple Traveling Salesmen Problem , 2013, J. Intell. Robotic Syst..
[30] Sanjeev Arora,et al. Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[31] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[32] Michel Gendreau,et al. Metaheuristics for the Capacitated VRP , 2002, The Vehicle Routing Problem.
[33] Ola Svensson,et al. Overview of New Approaches for Approximating TSP , 2013, WG.
[34] Joseph Naor,et al. A Polylogarithmic-Competitive Algorithm for the k-Server Problem , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[35] Beatrice M. Ombuki-Berman,et al. Using Genetic Algorithms for Multi-depot Vehicle Routing , 2009, Bio-inspired Algorithms for the Vehicle Routing Problem.
[36] J. K. Lenstra,et al. Complexity of vehicle routing and scheduling problems , 1981, Networks.
[37] Roberto Baldacci,et al. An Exact Method for the Capacitated Location-Routing Problem , 2011, Oper. Res..
[38] Anthony Stentz,et al. A Versatile Implementation of the TraderBots Approach for Multirobot Coordination , 2004 .
[39] Santosh S. Vempala,et al. On The Approximability Of The Traveling Salesman Problem , 2006, Comb..
[40] Chung-Lun Li,et al. Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems , 1990, INFORMS J. Comput..
[41] Allan Borodin,et al. An optimal on-line algorithm for metrical task system , 1992, JACM.