The concorde package
This package provides a simple interface to Concorde, a solver for the Traveling Salesperson Problem (TSP). Concorde is available from http://www.tsp.gatech.edu/concorde/index.html.
This library uses the Lin–Kernighan heuristic via Concorde's linkern program. It quickly produces good tours, which may not be optimal. You can directly control the tradeoff between run time and solution quality.
An example program is included.
Currently, only problems in two-dimensional Euclidean space are supported.
More features of Concorde can be added on request. Feature requests and patches are always welcome.
[Skip to Readme]
|Dependencies||base (>=3 && <5), containers (>=0.4), process (>=1.0), safe (>=0.3), temporary (>=1.1) [details]|
|Author||Keegan McAllister <email@example.com>|
|Maintainer||Keegan McAllister <firstname.lastname@example.org>|
|Source repository||head: git clone git://github.com/kmcallister/concorde|
|Uploaded||Fri Oct 21 07:18:15 UTC 2011 by KeeganMcAllister|
|Downloads||420 total (8 in the last 30 days)|
|Status||Docs uploaded by user
Build status unknown [no reports yet]
For package maintainers and hackage trustees