concorde: Simple interface to the Concorde solver for the Traveling Salesperson Problem
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]
Downloads
- concorde-0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
Versions [RSS] | 0.1 |
---|---|
Dependencies | base (>=3 && <5), containers (>=0.4), process (>=1.0), safe (>=0.3), temporary (>=1.1) [details] |
License | BSD-3-Clause |
Author | Keegan McAllister <mcallister.keegan@gmail.com> |
Maintainer | Keegan McAllister <mcallister.keegan@gmail.com> |
Category | Algorithms |
Source repo | head: git clone git://github.com/kmcallister/concorde |
Uploaded | by KeeganMcAllister at 2011-10-21T07:18:15Z |
Distributions | NixOS:0.1 |
Reverse Dependencies | 1 direct, 0 indirect [details] |
Downloads | 1487 total (3 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs uploaded by user Build status unknown [no reports yet] |