Premium
A statistical approach to the tsp
Author(s) -
Golden B. L.
Publication year - 1977
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230070303
Subject(s) - heuristic , mathematical optimization , computer science , travelling salesman problem , mathematics , algorithm
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.