论文信息 - Two Applications of the TSP for Data Analysis - 字舞流文

Two Applications of the TSP for Data Analysis

Michael Hahsler | Kurt Hornik | Michael Hahsler | K. Hornik

[1] Abraham P. Punnen,et al. The Traveling Salesman Problem: Applications, Formulations and Variations , 2007 .

[2] Weixiong Zhang,et al. Rearrangement Clustering: Pitfalls, Remedies, and Applications , 2006, J. Mach. Learn. Res..

[3] Gregory Gutin,et al. The traveling salesman problem , 2006, Discret. Optim..

[4] David S. Johnson,et al. Compressing Large Boolean Matrices using Reordering Techniques , 2004, VLDB.

[5] C. Alpert,et al. Splitting an Ordering into a Partition to Minimize Diameter , 1997 .

[6] Giovanni Rinaldi,et al. Facet identification for the symmetric traveling salesman polytope , 1990, Math. Program..

[7] Jacques Bertin,et al. Graphics and graphic information-processing , 1981 .

[8] Daniel J. Rosenkrantz,et al. An Analysis of Several Heuristics for the Traveling Salesman Problem , 1977, SIAM J. Comput..

[9] Jan Karel Lenstra,et al. Some Simple Applications of the Travelling Salesman Problem , 1975 .

[10] Jan Karel Lenstra,et al. Technical Note - Clustering a Data Array and the Traveling-Salesman Problem , 1974, Oper. Res..

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

[12] M. Held,et al. A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.