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--- Synchronet 3.20a-Linux NewsLink 1.114
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: | DaiTengu |
|---|---|
| Location: | Appleton, WI |
| Users: | 1,135 |
| Nodes: | 10 (0 / 10) |
| Uptime: | 32:39:05 |
| Calls: | 14,551 |
| Calls today: | 2 |
| Files: | 186,454 |
| D/L today: |
19,633 files (5,990M bytes) |
| Messages: | 2,570,078 |