<P> For benchmarking of TSP algorithms, TSPLIB is a library of sample instances of the TSP and related problems is maintained, see the TSPLIB external reference . Many of them are lists of actual cities and layouts of actual printed circuits . </P> <Ul> <Li> The thriller novel The Steradian Trail by M.N. Krish weaves the traveling salesman problem and mathematician Srinivasa Ramanujan and his accidental discovery into its plot connecting religion, mathematics, finance and economics . </Li> <Li> Travelling Salesman, by director Timothy Lanzone, is the story of four mathematicians hired by the U.S. government to solve the most elusive problem in computer - science history: P vs. NP . </Li> </Ul> <Li> The thriller novel The Steradian Trail by M.N. Krish weaves the traveling salesman problem and mathematician Srinivasa Ramanujan and his accidental discovery into its plot connecting religion, mathematics, finance and economics . </Li> <Li> Travelling Salesman, by director Timothy Lanzone, is the story of four mathematicians hired by the U.S. government to solve the most elusive problem in computer - science history: P vs. NP . </Li>

Use the mst program to get an approximate solution for travelling salesman problem