SE701:Traveling Salesperson Problem: Difference between revisions
Jump to navigation
Jump to search
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... |
(No difference)
|
Latest revision as of 20:12, 15 February 2008
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.
Link : http://www.cs.princeton.edu/courses/archive/fall06/cos126/assignments/tsp.html