TravellingSalesmanProblem TSP using XPRESS The attached MOS file solves the travelling salesman problem for 48 cities of the US in the given file. 3 and 4 city subtour eliminations are commented out since they time out in the student version of XPRESS