Newsgroups: comp.parallel
From: News Owner <news@oracle.rz.uni-ulm.de>
Subject: Re: Travelling Salesman Problem (parallel/sequential code)
Organization: University of Ulm, Germany
Date: Fri, 10 Nov 1995 22:15:23 GMT
Message-ID: <480itr$nqa@oracle.rz.uni-ulm.de>

F Haron (fazilah@scs.leeds.ac.uk) wrote:
: Hi,

: I'm looking for a sequential or parallel code for the Traveling Salesman
: Problem.  Can some one give me a pointer to it (ftpsite, papers etc)?

: Thanks in advance.

: Fazilah

Hi,

if you still need a fast algorithm to solve your
tsp-problem then try the branch-and-bound-paradigm,
discribed for example in the book:

   Graphentheoretische Methoden des Operations Research,
   von Kurt Haessig (germany),
   Stuttgart / Teubner, 1979,
   ISBN 3-519-02344-X
   PAGE: 121.

If you prefer it in your language, then just
look for a common description of this
method. It is easy to code, very fast and
has capabilities to become parallel.

Alexander Simianer

mailto:alexander.simianer@student.uni-ulm.de



