I am currently working on a project involving approximation algorithms to the Travelling Salesman problem. Lin & Kernighan published a paper in 1972 in Operations Research containing "the best algorithm yet" - I have a copy of the
paper but I can't get my head around the algorithm given.
Does anyone have some source code for the algorithm, or can anyone supply me with a further explanation?
Thanks
Spencer Bignell
sj...@cus.cam.ac.uk
Sysop: | Keyop |
---|---|
Location: | Huddersfield, West Yorkshire, UK |
Users: | 493 |
Nodes: | 16 (2 / 14) |
Uptime: | 02:18:15 |
Calls: | 9,707 |
Calls today: | 2 |
Files: | 13,740 |
Messages: | 6,180,731 |