Jünger, Michael; Reinelt, Gerhard; Rinaldi, Giovanni The traveling salesman problem. (English) Zbl 0832.90118 Ball, M. O. (ed.) et al., Network models. Amsterdam: North-Holland. Handb. Oper. Res. Manage. Sci. 7, 225-330 (1995). This paper presents a self-contained introduction into algorithmic and computational aspects of the traveling salesman problem and of related problems, along with their theoretical prerequisites as seen from the point of view of an operations researcher who wants to solve practical problem instances.Extensive computational results are reported on most of the algorithms described. Optimal solutions are reported for instances with sizes up to several thousand nodes as well as heuristic solutions with provably very high quality for larger instances.For the entire collection see [Zbl 0816.00040]. Reviewer: M.Jünger (Köln) Cited in 42 Documents MSC: 90C35 Programming involving graphs or networks 90C27 Combinatorial optimization 90-02 Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming Keywords:traveling salesman PDFBibTeX XMLCite \textit{M. Jünger} et al., Handb. Oper. Res. Manage. Sci. 7, 225--330 (1995; Zbl 0832.90118)