https://wiki.kram.nz/index.php?action=history&feed=atom&title=SE701%3ATraveling_Salesperson_ProblemSE701:Traveling Salesperson Problem - Revision history2026-06-30T07:40:33ZRevision history for this page on the wikiMediaWiki 1.45.3https://wiki.kram.nz/index.php?title=SE701:Traveling_Salesperson_Problem&diff=95&oldid=prevMark: New page: Given a set of N points in the plane, the goal of a traveling salesperson is to visit all of them (and arrive back home) while keeping the total distance traveled as short as possible. Wri...2008-02-15T20:12:19Z<p>New page: Given a set of N points in the plane, the goal of a traveling salesperson is to visit all of them (and arrive back home) while keeping the total distance traveled as short as possible. Wri...</p>
<p><b>New page</b></p><div>Given a set of N points in the plane, the goal of a traveling salesperson is to visit all of them (and arrive back home) while keeping the total distance traveled as short as possible. Write a program to compute an approximate solution to the traveling salesperson problem (TSP), and use it to find the shortest tour that you can, connecting a given set of points in the plane.<br />
<br />
Link : http://www.cs.princeton.edu/courses/archive/fall06/cos126/assignments/tsp.html</div>Mark