TSP - Infrastructure for the traveling salesperson problem

Journal of Statistical Software

Volumn 23, Issue 2, 2007, Pages 1-21

  Hahsler, Michael ^a   Hornik, Kurt ^a  

^a VIENNA UNIVERSITY OF ECONOMICS AND BUSINESS   (Austria)

Author keywords

Combinatorial optimization; R; Traveling salesman problem

Indexed keywords

EID: 38549147621     PISSN: 15487660     EISSN: 15487660     Source Type: Journal    
DOI: 10.18637/jss.v023.i02     Document Type: Article

References (35)

1. Alpert CJ, Kahng AB (1997). "Splitting an Ordering into a Partititon to Minimize Diameter." Journal of Classification, 14(1), 51-74.
2. Applegate D, Bixby R, Chvátal V, Cook W (2006). Concorde TSP Solver. URL http: //www.tsp.gatach.edu/concorde/.
3. Applegate D, Bixby RE, Chvátal V, Cook W (2000). "TSP Cuts Which Do Not Conform to the Template Paradigm." In M Junger, D Naddef (eds.), "Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions," volume 2241 of Lecture Notes In Computer Science, pp. 261-304. Springer-Verlag, London, UK.
4. Applegate D, Cook W, Rohe A (2003). "Chained Lin-Kernighan for Large Traveling Salesman Problems." INFORMS Journal on Computing, 15(1), 82-92.
5. Climer S, Zhang W (2006). "Rearrangement Clustering: Pitfalls, Remedies, and Applications." Journal of Machine Learning Research, 7, 919-943.
6. Croes GA (1958). "A Method for Solving Traveling-Salesman Problems." Operations Research, 6(6), 791-812.
7. Dantzig GB, Fulkerson DR, Johnson SM (1954). "Solution of a Large-scale Traveling Salesman Problem." Operations Research, 2, 393-410.
8. Garfinkel RS (1985). "Motivation and Modeling." In Lawler et al. (1985), chapter 2, pp. 17-36.
9. Gomory RE (1963). "An Algorithm for Integer Solutions to Linear Programs." In R Graves, P Wolfe (eds.), "Recent Advances in Mathematical Programming," pp. 269-302. McGraw-Hill, New York.
10. Gutin G, Punnen AP (eds.) (2002). The Traveling Salesman Problem and Its Variations, volume 12 of Combinatorial Optimization. Kluwer, Dordrecht.
11. Hahsler M, Buchta C, Hornik K (2006). seriation: Infrastructure for Seriation. R package version 0.1-1, URL http://CRAN.R-project.org/.
12. Held M, Karp RM (1962). "A Dynamic Programming Approach to Sequencing Problems." Journal of SIAM, 10, 196-210.
13. Hoffman AJ, Wolfe P (1985). "History." In Lawler et al. (1985), chapter 1, pp. 1-16.
14. Hubert LJ, Baker FB (1978). "Applications of Combinatorial Programming to Data Analysis: The Traveling Salesman and Related Problems." Psychometrika, 43(1), 81-91.
15. Johnson D, Krishnan S, Chhugani J, Kumar S, Venkatasubramanian S (2004). "Compressing Large Boolean Matrices Using Reordering Techniques." In "Proceedings of the 30th VLDB Conference," pp. 13-23.
16. Johnson DS, McGeoch LA (2002). "Experimental Analysis of Heuristics for the STSP." In Gutin and Punnen (2002), chapter 9, pp. 369-444.
17. Johnson DS, Papadimitriou CH (1985a). "Computational Complexity." In Lawler et al. (1985), chapter 3, pp. 37-86.
18. Johnson DS, Papadimitriou CH (1985b). "Performance Guarantees for Heuristics." In Lawler et al. (1985), chapter 5, pp. 145-180.
19. Johnson O, Liu J (2006). "A Traveling Salesman Approach for Predicting Protein Functions." Source Code for Biology and Medicine, 1(3), 1-7.
20. Jonker R, Volgenant T (1983). "Transforming Asymmetric into Symmetric Traveling Salesman Problems." Operations Research Letters, 2, 161-163.
21. Land AH, Doig AG (1960). "An Automatic Method for Solving Discrete Programming Problems." Econometrica, 28, 497-520.
22. Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (eds.) (1985). The Traveling Salesman Problem. Wiley, New York.
23. Lenstra JK (1974). "Clustering a Data Array and the Traveling-Salesman Problem." Operations Research, 22(2), 413-414.
24. Lenstra JK, Kan AHGR (1975). "Some Simple Applications of the Travelling Salesman Problem." Operational Research Quarterly, 26(4), 717-733.
25. Lin S (1965). "Computer Solutions of the Traveling-Salesman Problem." Bell System Technology Journal, 44, 2245-2269.
26. Lin S, Kernighan BW (1973). "An Effective Heuristic Algorithm for the Traveling-Salesman Problem." Operations Research, 21(2), 498-516.
27. Padberg M, Rinaldi G (1990). "Facet Identification for the Symmetric Traveling Salesman Polytope." Mathematical Programming, 47(2), 219-257. ISSN 0025-5610.
28. Pebesma EJ, Bivand RS (2005). "Classes and Methods for Spatial Data in R." R News, 5(2), 9-13. URL http://CRAN.R-project.org/doc/ Rnews/.
29. Prim RC (1957). "Shortest Connection Networks and Some Generalisations." Bell System Technical Journal, 36, 1389-1401.
30. Punnen AP (2002). "The Traveling Salesman Problem: Applications, Formulations and Variations." In Gutin and Punnen (2002), chapter 1, pp. 1-28.
31. Ray SS, Bandyopadhyay S, Pal SK (2007). "Gene Ordering in Partitive Clustering using Microarray Expressions." Journal of Biosciences, 32(5), 1019-1025.
32. R Development Core Team (2007). R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria, ISBN 3-900051-07-0, URL http: //www.R-project.org/.
33. Rego C, Glover F (2002). "Local Search and Metaheuristics." In Gutin and Punnen (2002), chapter 8, pp. 309-368.
34. Reinelt G (2004). TSPLIB. Universität Heidelberg, Institut für Informatik, Heidelberg, Germany. URL http://www.iwr.uni-heidelberg.de/ groups/comopt/software/ TSPLIB95/.
35. Rosenkrantz DJ, Stearns RE, Philip M Lewis I (1977). "An Analysis of Several Heuristics for the Traveling Salesman Problem." SIAM Journal on Computing, 6(3), 563-581.