previous | start | next

Traveling Salesman Problem

Visit each vertex exactly once and return to the starting vertex.

Minimize total cost

Greedy algorithm doesn't work!



previous | start | next