1 |
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, Solutions and Fractals, Vol. 13, pp. 71-78, 2002, doi:10.1016/S0960-0779(00)00227-7.
DOI
ScienceOn
|
2 |
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.
|
3 |
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.
|
4 |
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.
|
5 |
L. Stougie, "2P350: Optimaliseringsmethoden," http://www.win.tue.nl/-leen/OW/2P350/Week8/week8.pdf, College Wordt ggeven op vinjdagmiddag, 2001.
|
6 |
M. Lihoreau, L. Chittka, and N. E. Raine, "Travel Optimization by Foraging Bumblebees Through Readjustments of Traplines after Discovery of New Feeding Locations," The American Naturalist, Vol. 176, No. 6, pp. 744-757, 2010, doi:10.1086/657042.
DOI
|
7 |
E. Charniak and M. Herlihy, "CSC 751 Computational Complexity: Local Search Heuristics," Department of Computer Science, Brown University, 2008.
|
8 |
D. S. Johnson and L. A. McGeoch, "The Traveling Salesman Problem and Its Variations," Kluwer Academic Publishers, pp. 369-443, 2002.
|
9 |
A. Kazakov, R. A. Watson, and M. Zwolinski, "Traveling Salesman Problem: Local Search and Divide and Conquer Working Together," Independent Research Review, pp. 1-8, University of Southmapton, 2009.
|
10 |
C. L. Valenzuela and A. J. Jones, "Evolutionary Divide and Conquer (I): A Novel Genetic Approach to the TSP," Evolutionary Computation, Vol. 1, No. 4, pp. 313-333, 1994, doi:10.1162/evco.1993.1.4.313.
DOI
|
11 |
F. Bock, "An Algorithm for Solving Traveling-Salesman and Related Network Optimization Problems," The 14th ORSA National Meeting, 1958.
|
12 |
M. M. Flood, "The Traveling-Salesman Problem," Operations Research, Vol. 4, No. 1, pp. 61-75, 1956, doi:10.1287/opre.4.1.61.
DOI
|
13 |
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.
DOI
|
14 |
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.
DOI
|
15 |
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.
|
16 |
L. H. Chuin, "IS 703: Decision Support and Optimization," School of Information Systems," Department of Computer Science, Brown University, 2008.
|
17 |
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, http://www.jochen-pleines.de/download /ZIP2006.pdf, 2006.
|