Newsgroups: comp.constraints
Path: cantaloupe.srv.cs.cmu.edu!rochester!udel!news.mathworks.com!europa.chnt.gtegsc.com!howland.reston.ans.net!swrinde!elroy.jpl.nasa.gov!lll-winken.llnl.gov!ames!kronos.arc.nasa.gov!algorismus.arc.nasa.gov!frank
From: frank@algorismus.arc.nasa.gov (Jeremy Frank - Summer 94 til 11/1/94)
Subject: TSP Code please
Message-ID: <1995Jul7.002835.18801@ptolemy-ethernet.arc.nasa.gov>
Sender: usenet@ptolemy-ethernet.arc.nasa.gov (usenet@ptolemy.arc.nasa.gov)
Nntp-Posting-Host: algorismus.arc.nasa.gov
Organization: NASA/ARC Computational Sciences Division
Date: Fri, 7 Jul 1995 00:28:35 GMT
Lines: 18

Hello folks.  I am looking for C or LISP code which implements Kernighan and
Lin's K-Opt procedure to solve the Symmetric Travelling Salesman Problem.
I'd prefer C, but C++ or LISP will do.  I would like well-tested, clean code
so that I can modify it and perhaps change the K-Opt procedure.  (I'd also like
an implementation where K is a parameter, not hard-coded.  And while you're at it...)

I've checked several lists on the Web including TSPLIB, but all I can find are
either addresses of people with code or code for sale, no libraries or code archives.  

Please send me email, since I often do not read the newsgroups.  

Thanks in advance.  If there is sufficient interest, I will either publish a list of code archives or send the code I get to whoever is interested (provided of course the orignial sender agrees).

Cheers!

							JJ
							NASA Summer Student
							UCD Permanent Student
