home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1993 #3 / NN_1993_3.iso / spool / sci / math / 18718 < prev    next >
Encoding:
Text File  |  1993-01-25  |  661 b   |  21 lines
  1. Newsgroups: sci.math
  2. Path: sparky!uunet!math.fu-berlin.de!guckes
  3. From: guckes@math.fu-berlin.de (Sven Guckes)
  4. Subject: Re: Travelling Salesman Problem
  5. Message-ID: <HV401HE@math.fu-berlin.de>
  6. Originator: guckes@medusa
  7. Sender: news@math.fu-berlin.de (Math Department)
  8. Organization: Free University of Berlin, Germany
  9. References: <nharvey.727495472@probitas>
  10. Date: Mon, 25 Jan 1993 08:40:50 GMT
  11. Lines: 8
  12.  
  13. nharvey@probitas.cs.utas.edu.au (Nicole Harvey) writes:
  14.  
  15. >Is there an algorithm used in maths to solve this problem?
  16.  
  17. Yes:  Calculate all possibilities - then choose the best result.
  18.  
  19. -- 
  20. Sven@answers.answers.answers | You asked for ANY solution, right ? ;-)
  21.