The concorde package

[Tags: bsd3, library]

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]

Properties

Version0.1
Change logNone available
Dependenciesbase (>=3 && <5), containers (>=0.4), process (>=1.0), safe (>=0.3), temporary (>=1.1) [details]
LicenseBSD3
AuthorKeegan McAllister <mcallister.keegan@gmail.com>
MaintainerKeegan McAllister <mcallister.keegan@gmail.com>
CategoryAlgorithms
Source repositoryhead: git clone git://github.com/kmcallister/concorde
UploadedFri Oct 21 07:18:15 UTC 2011 by KeeganMcAllister
DistributionsNixOS:0.1
Downloads282 total (12 in last 30 days)
Votes
0 []
StatusDocs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees

Readme for concorde-0.1

This package provides a simple interface to Concorde, a solver for the
Traveling Salesperson Problem.  Concorde is available from:

    http://www.tsp.gatech.edu/concorde/index.html


Documentation for this package is hosted at:

    http://hackage.haskell.org/package/concorde

To build the documentation yourself, run

    $ cabal configure && cabal haddock --hyperlink-source

This will produce HTML documentation under dist/doc/html/concorde