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
[email protected]
| Sysop: | DaiTengu |
|---|---|
| Location: | Appleton, WI |
| Users: | 1,096 |
| Nodes: | 10 (0 / 10) |
| Uptime: | 117:08:25 |
| Calls: | 14,010 |
| Calls today: | 1 |
| Files: | 187,068 |
| D/L today: |
916 files (279M bytes) |
| Messages: | 2,474,715 |