 |
 |
Concorde is a computer code for the traveling salesman problem and some related network optimization problems. The code is written in the ANSI C programming language. It uses the QSopt function library extensively. Concorde has been used to obtain the optimal solutions to all but 4 of the 110 TSPLIB instances; the largest having 15,112 cities.
Executable versions of Concorde for MS Windows, Linux, and Solaris are now available for download.
|
 |
 |
 |
The idea of the Cutting-Plane Applet is to introduce the Dantzig, Fulkerson, and Johnson cutting-plane method by providing an interactive tool that can be used in the solution of some mid-sized TSP examples.
To use the applet online and for its documentation please goto to Cutting Plane Applet.
|
|
|