Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Travelling salesman problem
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Popular culture == * ''[[Travelling Salesman (2012 film)|Travelling Salesman]]'', by director Timothy Lanzone, is the story of four mathematicians hired by the U.S. government to solve the most elusive problem in computer-science history: [[P vs. NP]].<ref name=":0">{{Cite magazine|last=Geere|first=Duncan|title='Travelling Salesman' movie considers the repercussions if P equals NP|magazine=Wired UK |date=2012-04-26 |url=https://www.wired.co.uk/news/archive/2012-04/26/travelling-salesman |access-date=26 April 2012}}</ref> * Solutions to the problem are used by mathematician [[Robert A. Bosch]] in a subgenre called TSP art.<ref>''[https://blogs.scientificamerican.com/roots-of-unity/when-the-mona-lisa-is-np-hard/ When the Mona Lisa is NP-Hard]''By Evelyn Lamb, Scientific American, 31 April 2015</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)