SE701:Traveling Salesperson Problem

From Marks Wiki
Revision as of 20:12, 15 February 2008 by Mark (talk | contribs) (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...)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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

Retrieved from "https://wiki.kram.nz/index.php?title=SE701:Traveling_Salesperson_Problem&oldid=95"