If a sales man has to visit N cities and if each city is connected to the other city, then what is the shortest path he should take in order to minimize cost of travel? This article discusses the travelling sales man problem and its applications. http://www.travelingsales.net/
|
|