Travelling salesman problem tools for microcomputers

The problem of determining minimum total distance to be travelled by a salesman, who is to visit given cities each only once (i.e. the travelling salesman problem) is one of the most studied problems in computational mathematics. Finding an exact solution is not only intractably difficult, but also exceedingly costly. However, efficient optimal algorithms for both symmetric and asymmetric distance problems were implemented. The programs implemented can solve problems up to 180 cities in reasonable computer time.