Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
暂无分享,去创建一个
[1] David S. Johnson,et al. The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .
[2] Tore Grünert,et al. A Note on Single Alternating Cycle Neighborhoods for the TSP , 2005, J. Heuristics.
[3] Fred W. Glover,et al. Data structures and ejection chains for solving large-scale traveling salesman problems , 2005, Eur. J. Oper. Res..
[4] William J. Cook,et al. Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems , 2003, Math. Program..
[5] William J. Cook,et al. Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003, INFORMS Journal on Computing.
[6] Chris Walshaw,et al. A Multilevel Approach to the Travelling Salesman Problem , 2002, Oper. Res..
[7] Keld Helsgaun,et al. An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..
[8] William J. Cook,et al. Finding Tours in the TSP , 1999 .
[9] D. Corneil,et al. Efficient cluster compensation for lin-kernighan heuristics , 1999 .
[10] César Rego,et al. Relaxed tours and path ejections for the traveling salesman problem , 1998, Eur. J. Oper. Res..
[11] J. K. Lenstra,et al. Local Search in Combinatorial Optimisation. , 1997 .
[12] David S. Johnson,et al. Data structures for traveling salesmen , 1993, SODA '93.
[13] Gerhard Reinelt,et al. Fast Heuristics for Large Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..
[14] Fred Glover. New Ejection Chain and Alternating Path Methods for Traveling Salesman Problems , 1992, Computer Science and Operations Research.
[15] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..
[16] Marek Chrobak,et al. A Data Structure Useful for Finding Hamiltonian Cycles , 1990, Theor. Comput. Sci..
[17] D. M. Deighton,et al. Computers in Operations Research , 1977, Aust. Comput. J..
[18] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[19] Richard M. Karp,et al. The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..
[20] Richard M. Karp,et al. The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..