Difference between revisions of "Concorde"
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
| − | Concorde is a computer code for the traveling salesman problem (TSP) and some related network optimization problems. The code is available for academic research use; for other uses, contact [mailto:bico@isye.gatech.edu?Subject=Concorde%20non%20academic%20use William Cook ] for licensing options. |
+ | Concorde is a computer code for the traveling salesman problem (TSP) and some related network optimization problems. The code is available for academic research use; for other uses, contact [mailto:bico@isye.gatech.edu?Subject=Concorde%20non%20academic%20use William Cook ] for licensing options. |
Concorde's TSP solver has been used to obtain the optimal solutions to all TSPLIB instances having up to 15,112 cities. |
Concorde's TSP solver has been used to obtain the optimal solutions to all TSPLIB instances having up to 15,112 cities. |
||
| Line 29: | Line 29: | ||
This builds the concorde library (concorde.a), header file (concorde.h), and several executable programs, including: |
This builds the concorde library (concorde.a), header file (concorde.h), and several executable programs, including: |
||
| + | |||
| − | <pre> |
||
| − | TSP/concorde the TSP solver |
+ | * <tt>TSP/concorde</tt> the TSP solver |
| − | LINKERN/linkern the Lin-Kernighan TSP heuristic |
+ | * <tt>LINKERN/linkern</tt> the Lin-Kernighan TSP heuristic |
| − | EDGEGEN/edgegen generates edge sets |
+ | * <tt>EDGEGEN/edgegen</tt> generates edge sets |
| − | FMATCH/fmatch solves fractional 2-matching problems |
+ | * <tt>FMATCH/fmatch</tt> solves fractional 2-matching problems |
| − | </pre> |
||
Latest revision as of 14:08, 2 May 2008
Concorde is a computer code for the traveling salesman problem (TSP) and some related network optimization problems. The code is available for academic research use; for other uses, contact William Cook for licensing options.
Concorde's TSP solver has been used to obtain the optimal solutions to all TSPLIB instances having up to 15,112 cities.
The Concorde ANSI C source code is distributed as a gzipped tar file and is available here
How to install on Mac OS X platform
To unpack, first gunzip the downloaded file, then use tar to unpack the archive:
$ gunzip co031219.tgz $ tar xvf co031219.tar
Unpacking the distribution create a directory, "concorde", and several subdirectories. To configure, create a new directory called concorde_build, and run the configure script from inside there:
$ mkdir concorde_build $ cd concorde_build $ ../concorde/configure --host=i*-*-freebsd*
Then, you can compile concorde by using make:
$ make
This builds the concorde library (concorde.a), header file (concorde.h), and several executable programs, including:
- TSP/concorde the TSP solver
- LINKERN/linkern the Lin-Kernighan TSP heuristic
- EDGEGEN/edgegen generates edge sets
- FMATCH/fmatch solves fractional 2-matching problems
