On k th Best Policies
Richard Bellman, Robert E. Kalaba · Journal of the Society for Industrial and Applied Mathematics · 1960
Previous article Next article On kth Best PoliciesRichard Bellman and Robert KalabaRichard Bellman and Robert Kalabahttps://doi.org/10.1137/0108044PDFPDF PLUSBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] Richard Bellman, Dynamic programming, Princeton Univeristy Press, Princeton, N. J., 1957xxv+342 MR0090477 0995.90618 Google Scholar[2] Richard Bellman, On a routing problem, Quart. Appl. Math., 16 (1958), 87–90 MR0102435 0081.14403 CrossrefGoogle Scholar[3] F. Book, , H. Kantner and , J. Hynes, An algorithm (the r-th best path algorithm) for finding and ranking paths through a network, Research Report, Armour Research Foundation, 1958, May 19 Google Scholar[4] George B. Dantzig, Discrete-variable extremum problems, Operations Res., 5 (1957), 266–277 MR0089098 CrossrefISIGoogle Scholar[5] G. B. Dantzig, On the shortest route through a network, Paper P-1345, The RAND Corporation, 1958 Google Scholar[6] L. R. Ford, Jr., Network flow theory, Paper P-923, The RAND Corporation, 1956, August 14 Google Scholar[7] Walter Hoffman and , Richard Pavley, A method for the solution of the Nth best path problem, J. Assoc. Comput. Mach., 6 (1959), 506–514 MR0129019 0100.13103 CrossrefISIGoogle Scholar[8] R. Kalaba, On some communication network problemsa chapter in the book Combinatorial Analysis, Amer. Math. Soc., Providence, R.I., 1960 0096.14604 CrossrefGoogle Scholar[9] G. J. Minty, A comment on the shortest route problem, Operations Res., 5 (1957), 274– CrossrefISIGoogle Scholar Previous article Next article FiguresRelatedReferencesCited ByDetails The Pole Spotting ProblemSIAM Review, Vol. 4, No. 1 | 18 July 2006AbstractPDF (344 KB) Volume 8, Issue 4| 1960Journal of the Society for Industrial and Applied Mathematics History Submitted:04 November 1958Published online:10 July 2006 InformationCopyright © 1960 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0108044Article page range:pp. 582-588ISSN (print):0368-4245ISSN (online):2168-3484Publisher:Society for Industrial and Applied Mathematics