The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
The theory of dynamic programming
Open accessAbstract
Abstract : The paper is the text of an invited address before the annual summer meeting of the American Mathematical Society at Laramie, Wyoming, September 2, 1954. The contents are chiefly of an expository nature on the theory of dynamic programming.
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
Optimal two‐ and three‐stage production schedules with setup times included
Johnson, S. M. (1954) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800010110 · Cited by 3,252
Shapley, L. S. (1953) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.39.10.1095 · Cited by 2,382
Some aspects of the sequential design of experiments
Robbins, H. (1952) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1952-09620-8 · Cited by 2,184
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-citationToward a statistical theory of learning.
Estes, W. K. (1950) · Psychological Review · doi:10.1037/h0058559 · Cited by 994
Arrow, K. J., Harris, T., & Marschak, J. (1951) · Econometrica · doi:10.2307/1906813 · Cited by 967
Shapley, L. S. (1953) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.39.10.1953 · Cited by 677
A mathematical model for simple learning.
Bush, R. R., & Mosteller, F. (1951) · Psychological Review · doi:10.1037/h0054388 · Cited by 586
Bayes and Minimax Solutions of Sequential Decision Problems
Arrow, K. J., Blackwell, D., & Girshick, M. A. (1949) · Econometrica · doi:10.2307/1905525 · Cited by 274
A PROBLEM IN THE SEQUENTIAL DESIGN OF EXPERIMENTS
Bellman, R. (1954) · Cited by 190
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
Bellman, R. (1958) · Quarterly of Applied Mathematics · doi:10.1090/qam/102435 · Cited by 2,758
Self-citationOptimal Power Flow Management for Grid Connected PV Systems With Batteries
Riffonneau, Y., Bacha, S., Barruel, F., & Ploix, S. (2011) · IEEE Transactions on Sustainable Energy · doi:10.1109/tste.2011.2114901 · Cited by 973
Discrete-Variable Extremum Problems
Dantzig, G. B. (1957) · Operations Research · doi:10.1287/opre.5.2.266 · Cited by 910
High-order fully actuated system approaches: Part I. Models and basic procedure
Duan, G. (2021) · International Journal of Systems Science · doi:10.1080/00207721.2020.1829167 · Cited by 773
Metadata
- Authors
- Bellman, R.
- Venue
- Bulletin of the American Mathematical Society
- Publisher
- American Mathematical Society (AMS)
- Published
- 1954
- Volume
- 60
- Issue
- 6
- Pages
- 503-515
- ISSN
- 0002-9904 (ISSN-L)
- 0273-0979
- 1088-9485
- OpenAlex
- W1980516134
- Cited by
- 1,459
- References
- 23
- FWCI
- 37.69
- Type
- journal article
- Language
- en
- Open access
- diamond
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: The theory of dynamic programming. https://app.cochat.ai/papers/10.1090/s0002-9904-1954-09848-8
- The paper
- Bellman, R. (1954). The theory of dynamic programming. Bulletin of the American Mathematical Society. https://doi.org/10.1090/s0002-9904-1954-09848-8
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.