The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Some Problems in the Theory of Dynamic Programming
Abstract
Abstract : The theory of dynamic programming treats problems involving multi- stage processes by means of a transformation of the problem from the space of decisions to the space of functions. This is accomplished by deriving a functional equation whose solution is equivalent to the solution of the original problem. To illustrate this approach most clearly, free of extraneous analytic details, a simple but nontrivial multi-stage investment problem is considered. How exact solutions may be obtained in some cases, approximate solutions in others, and how these approximate solutions may be used to obtain more accurate solutions in the general case is shown. Of particular importance is the decrease in the number of independent variables made possible by this approach. This is not only important from the theoretical standpoint, but is also of great value in reducing the cost in time and effort of numerical computation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
On the theory of dynamic programming
Bellman, R. (1952) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.38.8.716 · Cited by 998
Self-citation
Cited by
Reversed graph embedding resolves complex single-cell trajectories
Qiu, X., Mao, Q., Tang, Y., Wang, L., Chawla, R., Pliner, H. A., & Trapnell, C. (2017) · Nature Methods · doi:10.1038/nmeth.4402 · Cited by 5,070
Lattimore, T., & Szepesvári, C. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108571401 · Cited by 976
Discrete-Variable Extremum Problems
Dantzig, G. B. (1957) · Operations Research · doi:10.1287/opre.5.2.266 · Cited by 910
Pesaran H.A, M., Huy, P. D., & Ramachandaramurthy, V. K. (2017) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2016.10.071 · Cited by 351
Metadata
- Authors
- Bellman, R.
- Venue
- Econometrica
- Publisher
- JSTOR
- Published
- 1954-01
- Volume
- 22
- Issue
- 1
- Pages
- 37
- ISSN
- 0012-9682 (ISSN-L)
- OpenAlex
- W1994924964
- Cited by
- 171
- References
- 1
- FWCI
- 32.30
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Some Problems in the Theory of Dynamic Programming. https://app.cochat.ai/papers/10.2307/1909830
- The paper
- Bellman, R. (1954). Some Problems in the Theory of Dynamic Programming. Econometrica. https://doi.org/10.2307/1909830
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.