Editing Travelling salesman problem (section)

==Further reading==
{{Refbegin|40em}}
*{{citation|first=Leonard|last=Adleman|author-link=Leonard Adleman|url=http://www.usc.edu/dept/molecular-science/papers/fp-sci94.pdf|title=Molecular Computation of Solutions To Combinatorial Problems|year=1994 |bibcode=1994Sci...266.1021A|volume=266|pages=1021–4|journal=Science|issue=5187|doi=10.1126/science.7973651 |archive-url=https://web.archive.org/web/20050206144827/http://www.usc.edu/dept/molecular-science/papers/fp-sci94.pdf |archive-date=6 February 2005|pmid=7973651|citeseerx=10.1.1.54.2565}}
*{{citation|first1=Gilbert|last1=Babin|first2=Stéphanie|last2=Deneault|first3=Gilbert|last3=Laportey |year=2005|title=Improvements to the Or-opt Heuristic for the Symmetric Traveling Salesman Problem |journal=The Journal of the Operational Research Society|series=Cahiers du GERAD|volume=G-2005-02|issue=3 |pages=402–407|publisher=Group for Research in Decision Analysis|location=Montreal|citeseerx=10.1.1.89.9953 |jstor=4622707}}
*{{Cite book|title-link= In Pursuit of the Traveling Salesman |title=In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation|last=Cook|first=William|date=2012|publisher=Princeton University Press |isbn=978-0-691-15270-7|author-link=William J. Cook}}
*{{citation|first1=William|last1=Cook|author1-link=William J. Cook|first2=Daniel|last2=Espinoza |first3=Marcos|last3=Goycoolea|title=Computing with domino-parity inequalities for the TSP|journal=INFORMS Journal on Computing |volume=19|issue=3|year=2007|pages=356–365|doi=10.1287/ijoc.1060.0204}}
*{{Cite book|contribution-url={{google books |plainurl=y |id=i-bUBQAAQBAJ}}|title=Introduction to Algorithms |last1=Cormen|first1=Thomas H.|last2=Leiserson|first2=Charles E.|last3=Rivest|first3=Ronald L. |last4=Stein |first4=Clifford |date=2009-07-31|publisher=MIT Press|isbn=978-0-262-03384-8|author1-link=Thomas H. Cormen |author2-link=Charles E. Leiserson|author3-link=Ronald L. Rivest|author4-link=Clifford Stein |edition=2nd |contribution=35.2: The traveling-salesman problem|pages=1027–1033|title-link=Introduction to Algorithms}}
*{{citation|first1=G. B.|last1=Dantzig|author1-link=George Dantzig|first2=R.|last2=Fulkerson|first3=S. M.|last3=Johnson|author3-link=Selmer M. Johnson|author2-link=D. R. Fulkerson|title=Solution of a large-scale traveling salesman problem|journal=Operations Research|volume=2|year=1954|pages=393–410 |doi=10.1287/opre.2.4.393|jstor=166695|issue=4|s2cid=44960960 |url=https://semanticscholar.org/paper/0fa37740fe865bcac0d9687c0e5f65131f4492c8}}
*{{Cite book|url={{google books |plainurl=y |id=fjxGAQAAIAAJ}}|title=Computers and Intractability: A Guide to the Theory of NP-completeness|last1=Garey|first1=Michael R.|last2=Johnson|first2=David S.|date=1979|publisher=W. H. Freeman|isbn=978-0-7167-1044-8|contribution=A2.3: ND22–24|pages=211–212}}
*{{citation|first=D. E.|last=Goldberg|title=Genetic Algorithms in Search, Optimization & Machine Learning|publisher=Addison-Wesley|location=New York|year=1989|isbn=978-0-201-15767-3|bibcode=1989gaso.book.....G|journal=Reading: Addison-Wesley}}
*{{Cite journal|date=2002-03-15|title=Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP|journal=Discrete Applied Mathematics|volume=117|issue=1–3|pages=81–86 |doi=10.1016/S0166-218X(01)00195-0|issn=0166-218X|first1=G.|last1=Gutin|first2=A.|last2=Yeo|first3=A. |last3=Zverovich|doi-access=free}}
*{{Cite book|url={{google books |plainurl=y |id=pfRSPwAACAAJ}}|title=The Traveling Salesman Problem and Its Variations|last1=Gutin|first1=G.|last2=Punnen|first2=A. P.|date=2007-05-18|publisher=Springer US|isbn=978-0-387-44459-8}}
*{{citation|first1=D. S.|last1=Johnson|author1-link=David S. Johnson|first2=L. A.|last2=McGeoch |contribution=The Traveling Salesman Problem: A Case Study in Local Optimization|title=Local Search in Combinatorial Optimisation |editor1-first=E. H. L.|editor1-last=Aarts|editor2-first=J. K.|editor2-last=Lenstra|editor2-link=Jan Karel Lenstra|publisher=John Wiley and Sons Ltd.|year=1997 |pages=215–310 |url=https://www.cs.ubc.ca/~hutter/previous-earg/EmpAlgReadingGroup/TSP-JohMcg97.pdf}}
*{{Cite book|url={{google books |plainurl=y |id=BXBGAAAAYAAJ}}|title=The Traveling Salesman Problem|last1=Lawler|first1=E. L.|last2=Shmoys|first2=D. B.|last3=Kan|first3=A. H. G. Rinnooy|last4=Lenstra|first4=J. K.|date=1985 |publisher=John Wiley & Sons, Incorporated|isbn=978-0-471-90413-7}}
*{{citation|first1=J. N.|last1=MacGregor|first2=T.|last2=Ormerod|year=1996|title=Human performance on the traveling salesman problem|journal=Perception & Psychophysics|volume=58|issue=4|pages=527–539 |doi=10.3758/BF03213088|pmid=8934685|s2cid=38355042|doi-access=free}}
*{{Cite journal|last1=Medvedev|first1=Andrei|last2=Lee|first2=Michael|last3=Butavicius|first3=Marcus |last4=Vickers|first4=Douglas|date=2001-02-01|title=Human performance on visually presented Traveling Salesman problems |journal=Psychological Research|volume=65|issue=1|pages=34–45|doi=10.1007/s004260000031|issn=1430-2772 |pmid=11505612 |s2cid=8986203}}
*{{citation|first=J. S. B.|last=Mitchell|author-link=Joseph S. B. Mitchell|year=1999|title=Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, ''k''-MST, and related problems|journal=SIAM Journal on Computing|volume=28 |pages=1298–1309 |doi=10.1137/S0097539796309764|issue=4}}
* {{cite conference|first1=S.|last1=Rao |first2=W. |last2=Smith|title=Approximating geometrical graphs via 'spanners' and 'banyans' |book-title=STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computing |year=1998 |pages=540–550|citeseerx=10.1.1.51.8676 }}
* {{Cite journal|publisher=SIAM (Society for Industrial and Applied Mathematics)|first1=Daniel J. |last1=Rosenkrantz |first2=Richard E. |last2=Stearns |first3=Philip M. II |last3= Lewis |title=An Analysis of Several Heuristics for the Traveling Salesman Problem |journal=SIAM Journal on Computing |volume=6 |issue=5 |pages = 563–581 |year=1977 |doi=10.1137/0206041|s2cid=14764079 }}
*{{citation |first1=Chris |last1=Walshaw |title=A Multilevel Approach to the Travelling Salesman Problem |publisher=CMS Press |year=2000}}
*{{citation |url=http://dimacs.rutgers.edu/Challenges/TSP/WalshawTR8001.ps|first1=Chris |last1=Walshaw |title=A Multilevel Lin-Kernighan-Helsgaun Algorithm for the Travelling Salesman Problem |publisher=CMS Press |year=2001}}
{{Refend}}