The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
4 Dynamic Programming and the Calculus of Variations
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
(1962) · Journal of the Franklin Institute · doi:10.1016/0016-0032(62)90845-1 · Cited by 409
Dynamic programming and the calculus of variations
Dreyfus, S. E. (1960) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(60)90024-x · Cited by 292
Modern mathematics for the engineer
Birx, D. L. (1957) · Journal of the Franklin Institute · doi:10.1016/0016-0032(57)90948-1 · Cited by 181
Methods of applied mathematics
Hargens, C. W. (1953) · Journal of the Franklin Institute · doi:10.1016/0016-0032(53)90356-1 · Cited by 169
(1961) · Journal of the Franklin Institute · doi:10.1016/0016-0032(61)90014-x · Cited by 167
Some aspects of the mathematical theory of control processes
Bellman, R., Glicksberg, I., & Gross, O. (1958) · Cited by 151
Elements of partial differential equations
(1957) · Journal of the Franklin Institute · doi:10.1016/0016-0032(57)90960-2 · Cited by 145
Dynamic programming and a new formalism in the calculus of variations
Bellman, R. (1954) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.40.4.231 · Cited by 123
The Theory of Dynamic Programming as Applied to a Smoothing Problem
Bellman, R., Glicksberg, I., & Gross, O. (1954) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0102007 · Cited by 20
On Some Variational Problems Occurring in the Theory of Dynamic Programming
Bellman, R., Glicksberg, I., & Gross, O. (1953) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.39.4.298 · Cited by 16
Cited by
Optimum consumption and portfolio rules in a continuous-time model
Merton, R. C. (1971) · Journal of Economic Theory · doi:10.1016/0022-0531(71)90038-x · Cited by 5,958
Using dynamic programming for solving variational problems in vision
Amini, A. A., Weymouth, T. E., & Jain, R. C. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.57681 · Cited by 1,008
Dual effect, certainty equivalence, and separation in stochastic control
Bar-Shalom, Y., & Tse, E. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100635 · Cited by 378
Dynamic Programming and Suboptimal Control: A Survey from ADP to MPC*
Bertsekas, D. P. (2005) · European Journal of Control · doi:10.3166/ejc.11.310-334 · Cited by 366
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Metadata
- Venue
- Mathematics in Science and Engineering
- Publisher
- Elsevier
- Published
- 1964
- Pages
- 79-155
- ISSN
- 0076-5392 (ISSN-L)
- OpenAlex
- W4252450337
- Cited by
- 262
- References
- 10
- FWCI
- 20.20
- Type
- book chapter
- 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: 4 Dynamic Programming and the Calculus of Variations. https://app.cochat.ai/papers/10.1016/s0076-5392(08)63116-1
- The paper
- 4 Dynamic Programming and the Calculus of Variations. (1964). Mathematics in Science and Engineering. https://doi.org/10.1016/s0076-5392(08)63116-1
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.