Re:TSP Tour in 3D through 2,079,471 stars
by knuthsat on Saturday October 17, 2020 @11:36AM
(#24810749)
Although here they used a Lin Kernighan Helsgaun heuristic for most of the work.
The heuristic algorithm does not use linear programming. Maybe a bit of graph theory, like minimum spanning trees or harder Steiner trees, mainly for selecting edges for the LKH heuristic.
The research group maintains an excellent webpage with many resources about the TSP [1]. They have also developed an app (Concorde TSP) [2] which provides really good graphical representation of the algorithm. There is an iOS app as well under the same name which has a nice interface.
[1]: http://www.math.uwaterloo.ca/tsp/ [2]: http://www.math.uwaterloo.ca/tsp/concorde/index.html