Date: Thu, 18 Apr 85 17:26:10 est
From:: Walter Hamscher
To: *mac@mc
Subject: REVOLTING SEMINAR FRIDAY, 3RD FLOOR

TIME: 12 Noon Friday
PLACE: 3rd Floor Theory Playroom
HOSTS: Bhaskar Ghudaroy and Mike Beckerle

	    COMPUTER AIDED CONCEPTUAL ART (CACA)
		  REVOLTING SEMINAR SERIES

			 :-) (-:

	      THE TRAVELING PRESIDENT PROBLEM

		       Tod Malmedy

We present a new variation of the traveling salesman problem.
There are two differences.  First, the links are free but the
nodes, representing memorials, have either small positive or
large negative weights, and the goal is to maximize this
weight.  Second, unlike most problems, in which a solver is
allowed to exaustively search the space of combinations for an
optimal solution, in this variation the value of the final
solution is penalized by the number of combinations tested
before finding it.  Under these conditions the L/D (Leave it
to Deaver) strategy can be proven to be the worst possible.

		REFRESHMENTS WILL BE SERVED