The Travelling Salesman Problem on Permuted
暂无分享,去创建一个
[1] R. Gomory,et al. Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .
[2] Ján Plesník,et al. The NP-Completeness of the Hamiltonian Cycle Problem in Planar Digraphs with Degree Bound Two , 1979, Inf. Process. Lett..
[3] E. Lawler,et al. Well-solved special cases , 1985 .
[4] Harold N. Gabow,et al. Data structures for weighted matching and nearest common ancestors with linking , 1990, SODA '90.
[5] James K. Park. A Special Case of the n-Vertex Traveling-Salesman Problem that can be Solved in O(n) Time , 1991, Inf. Process. Lett..
[6] Rainer E. Burkard,et al. Perspectives of Monge Properties in Optimization , 1996, Discret. Appl. Math..
[7] Gerhard J. Woeginger,et al. Well-solvable special cases of the TSP : a survey , 1996 .
[8] Abraham P. Punnen,et al. The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms , 1997 .