***********************************
                * Princeton Discrete Math Seminar *
                ***********************************

Date: Thursday 16th February, 2.00 in Fine Hall 224
PLEASE NOTE THE UNUSUAL START TIME!
 
Speaker: Bill Cook, Georgia Tech and Princeton

Title: The Traveling Salesman Problem: A Blueprint for Optimization

Given a list of cities along with the cost of travel between each pair
of them, the traveling salesman problem is to find the cheapest way to 
visit them all and return to your starting point.  Easy to state, but 
difficult to solve.  In this talk we discuss the problem's history, 
applications, and computation, laying out a blueprint for future work 
in discrete optimization and the practical solution of large-scale, 
possibly intractable, decision models.

                       -----------

Next week: TBA

Anyone wishing to be added to or removed from this mailing list should
contact Paul Seymour (pds@math.princeton.edu)