论文信息 - Fat Computational Complexity and Heuristic Design for the TSP: Fat Computational Complexity and Heuristic Design for the TSP - 字舞流文

Fat Computational Complexity and Heuristic Design for the TSP: Fat Computational Complexity and Heuristic Design for the TSP

Qiang Li | Hong Yu | He Jiang | Yan Hu

[1] G. Croes. A Method for Solving Traveling-Salesman Problems , 1958 .

[2] Johannes Schneider,et al. Searching for Backbones--a high-performance parallel algorithm for solving combinatorial optimization problems , 2003, Future Gener. Comput. Syst..

[3] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[4] William J. Cook,et al. Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003, INFORMS Journal on Computing.

[5] Keld Helsgaun,et al. An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..