References
- Wikipedia, "Travelling Salesman Problem," http://en.wikipedia.org/wiki/Travelling_Salesman_Problem, Wikimedia Foundation Inc., 2014.
- A. Likas and V. T. Paschos, "A Note on a New Greedy-Solution Representation and a New Greedy Parallelizable Heuristic for the Traveling Salesman Problem," Chaos, Solitons and Fractals, Vol. 13, pp. 71-78, 2002, doi: 10.1016/S0960-0779(00)00227-7.
- A. Schrijver, "On the History of Combinatorial Optimization (till 1960)," in Handbook of Discrete Optimization" (K. Aardal, G.L. Nemhauser, R. Weismantel, eds.), Elsevier, Amsterdam, pp. 1-68, http://homepages.cwi.nl/-lex/files/histco.pdf, 2005.
- J. Denzinger, D. Fuchs, M. Fuchs, and M. Kronenburg, "The Teamwork Method for Knowledge-Based Distributed Search: The travelling salesman problem," University of Kaiserslautern, 2008.
- J. Pleines, "ZIP-Methode: ein Kombinatorischer Ansatz zur Optimalen Losung Allgemeiner Traveling -Salesman-Problem (TSP)," Konnen bekannte Losungen nicht nur auf Gesamtgrphen sondern auf Teilgraphen angewandt werden, so bringt die ZIP-Methode den entscheidenden Quantensprung der rechentechnischen Vereinfachung, 2006.
- S. Vempala, "18.433 Combinatorial Optimization: NP-completeness," http://ocw.mit.edu/NR/rdonlyres/Mathematics/18-433Fall2003/778D00DB-F21C-486C-ABD8-F5E7F5C929C3/O/I20.pdf, 2003.
- L. Stougie, "2P350: Optimaliseringsmethoden," College Wordt ggeven op vinjdagmiddag, 2001.
- W. Cook, "The Traveling Salesman Problem," The School of Industrial and Systems Engineering, Gatorgia Tech, 2008.
- A. Battese, "Millennium Problems," Clay Mathematics Institute, 2014.
- E. Charniak and M. Herlihy, "CSC 751 Computational Complexity: Local Search Heuristics," Department of Computer Science, Brown University, 2008.
- D. S. Johnson and L. A. McGeoch, "The Traveling Salesman Problem: A Case Study in Local Optimization," Department of Mathematics and Computer Science, Amherst College, 1995.
- D. S. Johnson and L. A. McGeoch, "The Traveling Salesman Problem and Its Variations," Kluwer Academic Publishers, pp. 369-443, 2002.
- F. Bock, "An Algorithm for Solving Traveling Salesman and Related Network Optimization Problems," The 14th ORSA National Meeting, 1958.
- G. A. Croes, "The Traveling-Salesman Problem," Operations Research, Vol. 4, pp. 61-75, 1956. https://doi.org/10.1287/opre.4.1.61
- G. A. Croes, "A Method for Solving Traveling Salesman Problems," Operations Research, Vol. 6, pp. 791 - 812, 1958, doi: 10.1287/opre.6.6.791.
- S. Lin, "Computer Solutions of the Traveling Salesman Problem," Bell System Technical Journal, Vol. 44, pp. 2245-2269, 1965, doi: 10.1002/j.1538-7305.1965.tb04146.x.
- L. H. Chuin, "IS 703: Decision Support and Optimization," School of Information Systems," Department of Computer Science, Brown University, 2008.
- S. U. Lee, "The Extended k-opt Algorithm for Traveling Salesman Problem," Journal of KSCI, Vol. 17, No. 10, pp. 155-165, Oct. 2012, doi: 10.9708/jksci/2012.17.10.155.
- S. U. Lee, "A Polynomial Time Algorithm of a Traveling Salesman Problem," Journal of KSCI, Vol. 18, No. 12, pp. 75-82, Dec. 2013, doi: 10.9708/jksci.2013.18.12.075.
- K. Helsgaun, "An Effective Implementation of Kopt Moves for the Lin-Kernighan TSP Heuristics," Computer Science, Roskilde University, Denmark, 2007.
- G. Dantzig, R. Fulkerson, and S. Johnson, "Solution of a Large-scale Traveling-Salesman Problem," The Rand Corporation, http://www.cse.wustl.edu/-chen/7102/TSP.pdf, 1954.