The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
On a routing problem
Open accessAbstract
Given a set of N cities, with every two linked by a road, and the times required to traverse these roads, we wish to determine the path from one given city to another given city which minimizes the travel time. The times are not directly proportional to the distances due to varying quality of roads and varying quantities of traffic.
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
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Self-citationThe theory of dynamic programming
Bellman, R. (1954) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1954-09848-8 · Cited by 1,459
Self-citation
Cited by
AntNet: Distributed Stigmergetic Control for Communications Networks
Di Caro, G., & Dorigo, M. (1998) · Journal of Artificial Intelligence Research · doi:10.1613/jair.530 · Cited by 1,579
Eppstein, D. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539795290477 · Cited by 1,381
Job Shop Scheduling by Simulated Annealing
van Laarhoven, P. J. M., Aarts, E. H. L., & Lenstra, J. K. (1992) · Operations Research · doi:10.1287/opre.40.1.113 · Cited by 1,123
Route Planning in Transportation Networks
Bast, H., Delling, D., Goldberg, A., Müller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., & Werneck, R. F. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-49487-6_2 · Cited by 610
Faster Scaling Algorithms for Network Problems
Gabow, H. N., & Tarjan, R. E. (1989) · SIAM Journal on Computing · doi:10.1137/0218069 · Cited by 414
Metadata
- Authors
- Bellman, R.
- Venue
- Quarterly of Applied Mathematics
- Publisher
- American Mathematical Society (AMS)
- Published
- 1958-04
- Volume
- 16
- Issue
- 1
- Pages
- 87-90
- ISSN
- 0033-569X (ISSN-L)
- 1552-4485
- OpenAlex
- W2227557434
- Cited by
- 2,758
- References
- 2
- FWCI
- 10.10
- Type
- journal article
- Language
- en
- Open access
- bronze
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: On a routing problem. https://app.cochat.ai/papers/10.1090/qam/102435
- The paper
- Bellman, R. (1958). On a routing problem. Quarterly of Applied Mathematics. https://doi.org/10.1090/qam/102435
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.
