Nonoblivious 2-Opt heuristics for the traveling salesman problem
暂无分享,去创建一个
[1] Ola Svensson,et al. Approximating Graphic TSP by Matchings , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[2] Emile H. L. Aarts,et al. Theoretical aspects of local search , 2006, Monographs in Theoretical Computer Science. An EATCS Series.
[3] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .
[4] Abraham P. Punnen,et al. Approximate local search in combinatorial optimization , 2004, SODA '04.
[5] William J. Cook,et al. The Traveling Salesman Problem: A Computational Study , 2007 .
[6] Richard M. Karp,et al. The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..
[7] Mohit Singh,et al. A Randomized Rounding Approach to the Traveling Salesman Problem , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[8] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..
[9] Howard J. Karloff,et al. New results on the old k-opt algorithm for the TSP , 1994, SODA '94.
[10] Craig A. Tovey,et al. New Results on the Old k-opt Algorithm for the Traveling Salesman Problem , 1999, SIAM J. Comput..
[11] Paola Alimonti. New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems , 1994, CIAC.
[12] Rajeev Motwani,et al. On syntactic versus computational views of approximability , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[13] George C. Runger,et al. See the forest before the trees: fine-tuned learning and its application to the traveling salesman problem , 1998, IEEE Trans. Syst. Man Cybern. Part A.
[14] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[15] G. Croes. A Method for Solving Traveling-Salesman Problems , 1958 .
[16] David P. Williamson,et al. The Design of Approximation Algorithms: Random Sampling and Randomized Rounding of Linear Programs , 2011 .
[17] Nicos Christofides. Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.
[18] Richard M. Karp,et al. The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..
[19] David S. Johnson,et al. 8. The traveling salesman problem: a case study , 2003 .
[20] 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.
[21] Eric Angel,et al. A Survey of Approximation Results for Local Search Algorithms , 2006, Efficient Approximation and Online Algorithms.
[22] Sanjeev Arora,et al. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.
[23] Eugene L. Lawler,et al. Traveling Salesman Problem , 2016 .
[24] Marcin Mucha. 13/9-approximation for Graphic TSP , 2012, STACS.
[25] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.