Discrete Optimizing

Previous article Next article Discrete OptimizingStanley Reiter and Gordon ShermanStanley Reiter and Gordon Shermanhttps://doi.org/10.1137/0113056PDFPDF PLUSBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] J. T. Robacker, Some experiments on the traveling salesman problem, Research Report, RM-1521, RAND, 1955 Google Scholar[2] G. A. Croes, A method for solving traveling-salesman problems, Operations Res., 6 (1958), 791–812 MR0099887 CrossrefISIGoogle Scholar[3] Michael Held and , Richard M. Karp, A dynamic programming approach to sequencing problems, J. Soc. Indust. Appl. Math., 10 (1962), 196–210 10.1137/0110015 MR0139493 0106.14103 LinkISIGoogle Scholar[4] G. Dantzig, , R. Fulkerson and , S. Johnson, Solution of a large-scale traveling-salesman problem, J. Operations Res. Soc. Amer., 2 (1954), 393–410 MR0070932 CrossrefISIGoogle Scholar[5] R. L. Karg and , G. L. Thompson, A heuristic approach to traveling salesman problems, Management Sci., 10 (1964), 225–248 CrossrefISIGoogle Scholar Previous article Next article FiguresRelatedReferencesCited ByDetails An Analysis of Several Heuristics for the Traveling Salesman ProblemSIAM Journal on Computing, Vol. 6, No. 3 | 31 July 2006AbstractPDF (1958 KB)On the Complexity of Local Search for the Traveling Salesman ProblemSIAM Journal on Computing, Vol. 6, No. 1 | 13 July 2006AbstractPDF (889 KB) Volume 13, Issue 3| 1965Journal of the Society for Industrial and Applied Mathematics603-912 History Submitted:10 December 1963Accepted:07 October 1964Published online:13 July 2006 InformationCopyright © 1965 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0113056Article page range:pp. 864-889ISSN (print):0368-4245ISSN (online):2168-3484Publisher:Society for Industrial and Applied Mathematics