A statistical approach to the tsp
Bruce Golden · Networks · 1977
Abstract This paper is an example of the growing interface between statistics and mathematical optimization. A very efficient heuristic algorithm for the well‐known NP‐complete TSP is presented, from which statistical estimates of the optimal tour length can be derived. Assumptions, along with computational experience and conclusions are discussed.