The Traveling Salesman Problem:

To find the shortest path from start to end goingthrough all the points only once.

0

3

4

1

6

5

2

Source: Dr. Leonard M. Adleman

Previous slide

Next slide

Back to first slide

View graphic version