Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!zaphod.mps.ohio-state.edu!julius.cs.uiuc.edu!apple!agate!ucbvax!REMUS.EE.BYU.EDU!jlol
From: jlol@REMUS.EE.BYU.EDU (Jay Lawlor)
Newsgroups: comp.theory
Subject: Sources for S. Lin and B.W. Kernighan's TSP heuristic
Message-ID: <9012052109.AA28400@ucbvax.Berkeley.EDU>
Date: 5 Dec 90 21:09:48 GMT
Sender: daemon@ucbvax.BERKELEY.EDU
Reply-To: jlol@ee.byu.edu
Lines: 14
I'm looking for source code (preferably C, but I'll take what I can
get) for the TSP heuristic presented in
S. Lin and B.W. Kernighan, "An Effective Heuristic Algorithm for the
Traveling-Salesman Problem", Operations Research, 21, 1973, pp. 498-516.
I want to compare it against some other algorithms. I have the paper
but would like to save the work of coding it myself if possible.
Can anyone out there help me?
Thanks.
Jay Lawlor