next up previous
Next: Problem 3 (15 Points) Up: Problem Set 3 Previous: Problem 1 (60 Points)

Problem 2 (15 Points)

The Constrained Traveling Salesman Problem. Now suppose these $ N+1$ cities belong to $ P$ countries and the salesman needs to visit all cities in a country before exiting. Can you modified your method in the previous problem and find the best tour for the salesman in this case? You only need to describe your method.



Mulin Cheng 2008-03-06