home *** CD-ROM | disk | FTP | other *** search
/ Usenet 1994 January / usenetsourcesnewsgroupsinfomagicjanuary1994.iso / sources / unix / volume27 / distributed-c-2.1 / part01 / examples / travel / READ.ME < prev   
Encoding:
Text File  |  1993-12-22  |  380 b   |  11 lines
  1.                   The traveling salesman problem
  2.                   ==============================
  3.  
  4. Description:
  5.  
  6.     A traveling salesman has to make a round trip through n cities, but
  7.     should visit each city only once! At the end of his journey he should
  8.     return to his starting point.
  9.     The problem is to find a round trip whose way length is the shortest
  10.     possible.
  11.