i want travelling sales man problem reff i just want concep and howe to construct?

Question

send refff site address

Answer 1

Imagine that a travelling salesman has to hit, say, 100 cities in the USA, and he knows road distances between them, what's the minimum distance he has to travel to do all of them and come back home? There are numerous variations on this problem, but this kind of a problem usually defies mathematical analysis. It's called a "NP-hard' problem, which is a measure of the time it takes a computer to determine the optimum path.

Answer 2

Take a look at

http://en.wikipedia.org/wiki/Traveling_salesman_problem