Path to this page:
./
wip/concorde,
Combinatorial Optimization package
Branch: CURRENT,
Version: 20031219,
Package name: concorde-20031219,
Maintainer: jihbed.researchConcorde is a computer code for the traveling salesman problem (TSP)
and some related network optimization problems. The code is written
in the ANSI C programming language and it is available for academic
research use; for other uses, contact bico@isye.gatech.edu for
licensing options.
Concorde's TSP solver has been used to obtain the optimal solutions to
106 of the 110 TSPLIB instances; the largest having 15,112 cities.
The Concorde callable library includes over 700 functions permitting
users to create specialized codes for TSP-like problems. All Concorde
functions are thread-safe for programming in shared-memory parallel
environments; the main TSP solver includes code for running over
networks of Unix workstations
Required to run:[
lang/nawk]
Required to build:[
pkgtools/cwrappers]
Master sites:
RMD160: 2997eefc525918713d48b3bd4330fabd6b61fde3
Filesize: 682.219 KB
Version history: (Expand)
- (2024-09-19) Package has been reborn
- (2024-09-15) Package deleted from pkgsrc
- (2023-02-13) Package has been reborn
- (2020-09-29) Package has been reborn
- (2020-09-29) Package deleted from pkgsrc
- (2020-01-02) Package has been reborn