head	1.1;access;symbols	zero-five-zero:1.1	zero-four-seventeen:1.1	zero-four-ten:1.1	zero-four-nine:1.1	zero-four-eight:1.1;locks	neto:1.1;comment	@# @;1.1date	98.08.14.20.30.41;	author neto;	state Exp;branches;next	;desc@The description used when submitting to http://freshmeat.net@1.1log@Initial revision@text@  LK is an implementation of the Lin-Kernighan heuristic for the Traveling  Salesman Problem and for the minimum weight perfect matching problem. It is  tuned for 2-d geometric instances, and has been applied to certain  instances with up to a million cities. Also included are instance generators  and Perl scripts for munging TSPLIB instances.<p>  This implementation introduces ``efficient cluster compensation'', an  experimental algorithmic technique intended to make the Lin-Kernighan  heuristic more robust in the face of clustered data.<p>  Parts of LK are rock solid. Other parts are alpha, and everything in between.  It's written in CWEB for your reading pleasure.@