The Theory of Dynamic Programming as Applied to a Smoothing Problem

Previous article Next article The Theory of Dynamic Programming as Applied to a Smoothing ProblemR. Bellman, I. Glicksberg, and O. GrossR. Bellman, I. Glicksberg, and O. Grosshttps://doi.org/10.1137/0102007PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] Richard Bellman, An introduction to the theory of dynamic programming, The Rand Corporation, Santa Monica, Calif., 1953x+99, Report R-245 MR0061805 Google Scholar[2] R. Bellman, A problem in the theory of dynamic programming, Econometrica, (1954), , Jan. CrossrefISIGoogle Scholar[3] Richard Bellman, Bottleneck problems and dynamic programming, Proc. Nat. Acad. Sci. U. S. A., 39 (1953), 947–951 MR0061808 CrossrefISIGoogle Scholar[4] Richard Bellman, On the theory of dynamic programming, Proc. Nat. Acad. Sci. U. S. A., 38 (1952), 716–719 MR0050856 CrossrefISIGoogle Scholar[5] Richard Bellman, , Irving Glicksberg and , Oliver Gross, On some variational problems occurring in the theory of dynamic programming, Proc. Nat. Acad. Sci. U. S. A., 39 (1953), 298–301 MR0054183 CrossrefISIGoogle Scholar[6] R. Bellman and , O. .Gross, Some combinatorial problems occurring in the theory of multi-stage processes, (to appear). Google Scholar Previous article Next article FiguresRelatedReferencesCited byDetails Mathematical Aspects of Scheduling TheoryRichard Bellman10 July 2006 | Journal of the Society for Industrial and Applied Mathematics, Vol. 4, No. 3AbstractPDF (3433 KB) Volume 2, Issue 2| 1954Journal of the Society for Industrial and Applied Mathematics History Submitted:22 February 1954Published online:10 July 2006 InformationCopyright © 1954 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0102007Article page range:pp. 82-88ISSN (print):0368-4245ISSN (online):2168-3484Publisher:Society for Industrial and Applied Mathematics