Newsgroups: comp.parallel
From: Lynnetta Pressley <pressley@mailer.fsu.edu>
Subject: Traveling Salesman Problem
Organization: Florida State University
Date: Sat, 17 Jun 1995 15:13:50 GMT
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Message-ID: <3rurfe$jfi@mailer.fsu.edu>

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.



