论文信息 - Large-step markov chains for the TSP incorporating local search heuristics - 字舞流文

Large-step markov chains for the TSP incorporating local search heuristics

Edward W. Felten | Steve W. Otto | Olivier Martin | E. Felten | S. Otto | O. Martin

[1] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[2] Edward W. Felten,et al. Large-Step Markov Chains for the Traveling Salesman Problem , 1991, Complex Syst..

[3] M. Padberg,et al. Addendum: Optimization of a 532-city symmetric traveling salesman problem by branch and cut , 1990 .

[4] David S. Johnson,et al. Local Optimization and the Traveling Salesman Problem , 1990, ICALP.

[5] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[6] Heinz Mühlenbein,et al. Evolution algorithms in combinatorial optimization , 1988, Parallel Comput..

[7] Eugene L. Lawler,et al. Traveling Salesman Problem , 2016 .

[8] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.

[9] H. Crowder,et al. Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality , 1980 .

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

[11] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .

[12] J. P. Secrétan,et al. Der Saccus endolymphaticus bei Entzündungsprozessen , 1944 .