Construction Heuristics and Domination Analysis for the Asymmetric TSP
暂无分享,去创建一个
Fred W. Glover | Gregory Gutin | Anders Yeo | Alexey Zverovich | F. Glover | G. Gutin | A. Zverovich | Anders Yeo
[1] G. Reinelt. The traveling salesman: computational solutions for TSP applications , 1994 .
[2] J. K. Lenstra,et al. Local Search in Combinatorial Optimisation. , 1997 .
[3] William J. Cook,et al. Combinatorial optimization , 1997 .
[4] Jacques Carlier,et al. A new heuristic for the traveling Salesman problem , 1990 .
[5] Richard M. Karp,et al. A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem , 1979, SIAM J. Comput..
[6] Gerhard J. Woeginger,et al. A study of exponential neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment Problem , 2000, Math. Program..
[7] Eugene L. Lawler,et al. Traveling Salesman Problem , 2016 .
[8] Gregory Gutin,et al. Exponential neighbourhood local search for the traveling salesman problem , 1999, Comput. Oper. Res..
[9] Anders Yeo,et al. Large Exponential Neighbourhoods for the Traveling Salesman Problem , 1997 .
[10] Gregory Gutin,et al. Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour , 1999, Comput. Oper. Res..
[11] Abraham P. Punnen,et al. The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms , 1997 .