Newsgroups: comp.ai.neural-nets
Path: cantaloupe.srv.cs.cmu.edu!nntp.club.cc.cmu.edu!newsfeed.pitt.edu!gatech!news-feed-1.peachnet.edu!insosf1.infonet.net!solaris.cc.vt.edu!uunet!zib-berlin.de!uniol!Thomas.Mantay
From: Thomas.Mantay@arbi.informatik.uni-oldenburg.de (Thomas Mantay)
Subject: Q: Algorithm for the TSP?
Organization: University of Oldenburg, Germany
Date: Tue, 3 Jan 1995 16:52:06 GMT
Message-ID: <1995Jan3.165634.746@arbi.Informatik.Uni-Oldenburg.DE>
Sender: news@arbi.Informatik.Uni-Oldenburg.DE
Lines: 26


Hello,

could anyone tell me if there's an algorithm that
solves the travelling salesman problem in better
time complexity than O(n)? It doesn't matter if it's
a neural net or a convertional algorithm. Which
algorithm is the best known today and where is it 
published?

Thanks,

Thomas Mantay

-- 
***************************************************************************
*                                                                         *
* E-Mail:  Thomas.Mantay@arbi.Informatik.Uni-Oldenburg.DE                 *
* Real:    Thomas Mantay, Student of the University of Oldenburg, Germany *
*          Kaethe-Kollwitz-Str. 24                                        *
*          D-26127 Oldenburg                                              *
*          Germany                                                        *
*          Phone: 0441/3046501 (from within Germany)                      *
*                 +49/441/3046501 (from abroad)                           *
*                                                                         *
***************************************************************************
