|
Grex > Science > #52: Teraveling salesman problem(T.S.P) | |
|
| Author |
Message |
smjghms
|
|
Teraveling salesman problem(T.S.P)
| 
Jul 29 06:14 UTC 1999 |
Do you know, what is Traveling salesman problem(T.S.P)?
|
| 5 responses total. |
russ
|
|
response 1 of 5:
|
Jul 29 12:28 UTC 1999 |
The Travelling Salesman problem is the problem of computing the route
between a set of stops which visits each stop and has the shortest total
distance. Since the number of possible routes rises factorially with
the number of stops, it's not an easy problem to solve.
|
smjghms
|
|
response 2 of 5:
|
Aug 1 10:07 UTC 1999 |
Hi, "Russ Cage" dear;
This is right, I write a computer program for Traveling salesman problem
solving. I do like very much this problem, but I dontn't know witch, this
program(I did write) is correct or no.
Can you help me about this?
Thanks a lot, goodbyeee.
your firend "smjghms"
|
russ
|
|
response 3 of 5:
|
Aug 2 00:57 UTC 1999 |
Can't help you, I'm not a mathematical analyst.
|
daryl
|
|
response 4 of 5:
|
Jul 23 15:55 UTC 2001 |
Hi all. To my best concern, there are not "good" algorithms to solve this
problem (good in the sense of being soved in polynomial time). In fact, it's
a classic example of NP-hard problem.
|
gull
|
|
response 5 of 5:
|
Jul 23 17:49 UTC 2001 |
The problem being, of course, that it's also a very useful thing to figure
out. ;>
|