[Albers, D. & Reid, C. The College Mathematics Journal, Vol. 17, No. 4 (Sep., 1986), pp. 292-314. Downloaded on December 30, 2014 from http://www.jstor.org/stable/25146928?Search=yes&resultItemClick=true&searchText=albers&searchText=reid&searchUri=%2Faction%2FdoBasicSearch%3FQuery%3Dalbers%2Breid%26amp%3BSearch%3DSearch%26amp%3Bwc%3Don%26amp%3Bfc%3Doff%26amp%3BglobalSearch%3D%26amp%3BsbbBox%3D%26amp%3BsbjBox%3D%26amp%3BsbpBox%3D&seq=2#page_scan_tab_contents]Search in Google Scholar
[Cummings, N. (June 2000). A Brief History of TSP. OR Newsletter. Downloaded on April 27, 2015 from http://www.theorsociety.com/Pages/ORMethods/Heuristics/articles/HistoryTSP.aspx]Search in Google Scholar
[Frontline Systems. (n.d.) Downloaded on January 2, 2015 from http://www.solver.com/]Search in Google Scholar
[Patterson, M. & Harmel, B. (2003). Solving the Traveling Salesman Problem Using Premium Solver Platform. International Journal of Management, 22 (4), 532-541.]Search in Google Scholar
[Robinson, J. B. (1949). On the Hamiltonian Game (a traveling salesman problem). Rand Research Memorandum RM-303.]Search in Google Scholar
[Tuza, Z. (2001). Unsolved Combinatorial Problems, Part I. Downloaded on December 30, 2015 from http://www.brics.dk/LS/01/1/BRICS-LS-01-1.pdf]Search in Google Scholar
[Williams, H. P. (1999). Model Building in Mathematical Programming. (255-256). Chichester: John Wiley & Sons.]Search in Google Scholar