Για τον τι ακριβώς είναι ο αλγόριθμος δες http://www.pcug.org.au/~dakin/tsp.htm
"...The Travelling Salesman Problem (TSP) is a deceptively simple combinatorial problem. It can be stated very simply: A salesman spends his time visiting n cities (or nodes) cyclically. In one tour he visits each city just once, and finishes up where he started. In what order should he visit them to minimise the distance travelled? ....... The holy grail is to find a solution algorithm that gives an optimal solution in a time that has a polynomial variation with the size n of the problem. If you could find a method whose solution time varies like a quadratic expression, for example, then doubling n multiplies the solution time by 4 for large n. The best that people have been able to do, however, is to solve it in a time that varies exponentially with n. Such algorithms run out of puff at a certain level of n, more or less independently of computing power. If computation varies as 2^n, say, then a thousand-fold increase in computing power will only allow you to add another 10 nodes. So an algorithm that peters out at 50 cites now will probably never get you to 100 nodes, whatever happens to hardware technology.

... ο A*, ο αλγόριθμος θα επεκτείνει ... να λύσετε το πρόβλημα του πλανόδιου πωλητή. ... www.samos.aegean.gr/icsd/konsterg/teaching/AI/Assignment1.d...
... για το πρόβλημα του πλανόδιου πωλητή. ... Δεδομένου του συνόλου Ν ... 4,5}, {3,4,5}.... www.aueb.gr/lessons/d5/epl448/june_2000.htm
... το πρόβλημα του πλανόδιου πωλητή, διαμέριση γράφων. ... simulated annealing) ... www2.di.uoa.gr/gr/lessondescr.php?GetWhat=36

--------------------------------------------------
Note added at 5 hrs 28 mins (2004-03-17 18:03:45 GMT)
--------------------------------------------------

Δεν διαφωνώ για το περιοδεύων πωλητής ... :) .. δεν το έβαλα στην απάντηση μου και αυτό ήταν παράβλεψη όντως. (Βαράτε με αλύπητα! χεχε)