 The CSE 521 course project is to implement algorithms for the Traveling Tourist Problem, and test them out on various data sets. The <a href=http://www.cs.washington.edu/education/courses/521/winter96/project/fastest.html> Speedy Tourist Page </a> keeps track of the best tours found on each of the problem instances in the project data set.  The <a href=http://www.cs.washington.edu/education/courses/521/winter96/project/challenge.html>Challenge Page </a> gives a few specific challenges, and <a href=http://www.cs.washington.edu/education/courses/521/winter96/project/lower.html>Lower bound page</a> gives the best known lower bounds.  Last update: 1/24/96. Eric Anderson has developed an  <a href="http://www.cs.washington.edu/homes/eric/java/TravellingTourist.html"> applet</a> to animate tours.  <p>
