Newsgroups: comp.parallel
From: atl@mathematik.uni-ulm.de (Andreas Leibl)
Subject: Re: Traveling Salesman Problem
Organization: University of Ulm, SAI, Germany
Date: Thu, 22 Jun 1995 12:45:08 GMT
Message-ID: <3sbokk$b25@waage.rz.uni-ulm.de>

Hello Lynnetta.

Lynnetta Pressley (pressley@mailer.fsu.edu) wrote:
:I am a student at Florida A & M University doing a senior design project on the
:traveling salesman problem and parallel computing.  If you have any information
: regarding this topic, please do not hesistate to respond.  In particular, I
: would like to know whether there are any valid solutions for any TSP with the
: number of cities greater than 318.  Also, various types of algorithms would be
:helpful so that they can be implemented and tested to see how they respond on a
: parallel processor.  Please make sure that all algorithms are written in C.  I
: would appreciate an e-mail of the program(s), or you can send it through the
: postal system.  My e-mail address is pressley@evax.eng.fsu.edu and my regular
: address is 2922 Miccosukee Rd. Apt. 7D, Tallahassee, FL, 32308. Thank you in
: advance.

Much work on parallel algorithms for the TSP was done in Paderborn.
Check out this URL:

  http://www.uni-paderborn.de/fachbereich/AG/monien/PERSONAL/rl.html


Bye
                Andy
-- 
Andreas Leibl / grad. student / Dept. of Physics, University of Ulm, Germany
Theoretical Physics I / Room O25 - 406 / Phone 0731-502-2918
leibl@physik.uni-ulm.de             http://www.mathematik.uni-ulm.de/~atl/ 
atl@mathematik.uni-ulm.de           irc: croc (see you later, alligator :-))
-----------------------------------------------------------------------------
Wenn einer behauptet, er verstehe die Welt nicht mehr, so ist das reine
Koketterie - kein Mensch hat die Welt je verstanden.

