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.
- No changelog available
Properties
| Version | 0.1 |
|---|---|
| Dependencies | base (>=3 && <5), containers (>=0.4), process (>=1.0), safe (>=0.3), temporary (>=1.1) |
| License | BSD3 |
| Author | Keegan McAllister <mcallister.keegan@gmail.com> |
| Maintainer | Keegan McAllister <mcallister.keegan@gmail.com> |
| Category | Algorithms |
| Source repository | head: git clone git://github.com/kmcallister/concorde |
| Upload date | Fri Oct 21 07:18:15 UTC 2011 |
| Uploaded by | KeeganMcAllister |
| Downloads | 115 total (13 in last 30 days) |
Modules
- Algorithms
- Concorde
[Index]
Downloads
- concorde-0.1.tar.gz [browse] (Cabal source package)
- Package description (included in the package)
Maintainers' corner
For package maintainers and hackage trustees