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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
Pregel: a system for large-scale graph processing
Malewicz, G., Austern, M. H., Bik, A. J. C., Dehnert, J. C., Horn, I., Leiser, N., & Czajkowski, G. (2010) · Proceedings of the 2010 ACM SIGMOD International Conference on Management of data · doi:10.1145/1807167.1807184 · Cited by 3,515
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
Selective review of offline change point detection methods
Truong, C., Oudre, L., & Vayatis, N. (2020) · Signal Processing · doi:10.1016/j.sigpro.2019.107299 · Cited by 1,338
Optimal description of a protein structure in terms of multiple groups undergoing TLS motion
Painter, J., & Merritt, E. A. (2006) · Acta Crystallographica Section D Biological Crystallography · doi:10.1107/s0907444906005270 · Cited by 1,240
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
Efficient Algorithms for Shortest Paths in Sparse Networks
Johnson, D. B. (1977) · Journal of the ACM · doi:10.1145/321992.321993 · Cited by 1,041
An Appraisal of Some Shortest-Path Algorithms
Dreyfus, S. E. (1969) · Operations Research · doi:10.1287/opre.17.3.395 · Cited by 1,002
Über ein Paradoxon aus der Verkehrsplanung
Braess, D. (1968) · Unternehmensforschung Operations Research - Recherche Opérationnelle · doi:10.1007/bf01918335 · Cited by 911
(1998) · Choice Reviews Online · doi:10.5860/choice.35-6287 · Cited by 904
Shortest paths algorithms: Theory and experimental evaluation
Cherkassky, B. V., Goldberg, A. V., & Radzik, T. (1996) · Mathematical Programming · doi:10.1007/bf02592101 · Cited by 899
Routing and scheduling of vehicles and crews
Raff, S. (1983) · Computers & Operations Research · doi:10.1016/0305-0548(83)90030-8 · Cited by 867
Labeled Random Finite Sets and the Bayes Multi-Target Tracking Filter
Vo, B.-N., Vo, B.-T., & Phung, D. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2364014 · Cited by 764
Chiu, S. J., Li, X. T., Nicholas, P., Toth, C. A., Izatt, J. A., & Farsiu, S. (2010) · Optics Express · doi:10.1364/oe.18.019413 · Cited by 733
Miné, A. (2006) · Higher-Order and Symbolic Computation · doi:10.1007/s10990-006-8609-1 · Cited by 720
The design and implementation of an intentional naming system
Adjie-Winoto, W., Schwartz, E., Balakrishnan, H., & Lilley, J. (1999) · Proceedings of the seventeenth ACM symposium on Operating systems principles · doi:10.1145/319151.319164 · Cited by 673
The image foresting transform: theory, algorithms, and applications
Falcao, A. X., Stolfi, J., & de Alencar Lotufo, R. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1261076 · Cited by 614
Steiner problem in networks: A survey
Winter, P. (1987) · Networks · doi:10.1002/net.3230170203 · Cited by 599
Social Media Mining: An Introduction
Zafarani, R., Abbasi, M. A., & Liu, H. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139088510 · Cited by 592
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
Christofides, N., Mingozzi, A., & Toth, P. (1981) · Mathematical Programming · doi:10.1007/bf01589353 · Cited by 535
Control Techniques for Complex Networks
Meyn, S. (2007) · Cambridge University Press eBooks · doi:10.1017/cbo9780511804410 · Cited by 528
CAVER: a new tool to explore routes from protein clefts, pockets and cavities
Petřek, M., Otyepka, M., Banáš, P., Košinová, P., Koča, J., & Damborský, J. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-316 · Cited by 521
Link prediction techniques, applications, and performance: A survey
Kumar, A., Singh, S. S., Singh, K., & Biswas, B. (2020) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2020.124289 · Cited by 516
Route choice modeling: past, present and future research directions
Prato, C. G. (2009) · Journal of Choice Modelling · doi:10.1016/s1755-5345(13)70005-8 · Cited by 495
Stable Function Approximation in Dynamic Programming
Gordon, G. J. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50040-2 · Cited by 446
Faster Scaling Algorithms for Network Problems
Gabow, H. N., & Tarjan, R. E. (1989) · SIAM Journal on Computing · doi:10.1137/0218069 · Cited by 414
Gai, Y., Krishnamachari, B., & Jain, R. (2012) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2011.2181864 · Cited by 413
The shortest route through a network with time-dependent internodal transit times
Cooke, K. L., & Halsey, E. (1966) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(66)90009-6 · Cited by 412
The Fastest Path through a Network with Random Time-Dependent Travel Times
Hall, R. W. (1986) · Transportation Science · doi:10.1287/trsc.20.3.182 · Cited by 404
Chapter 2 Time constrained routing and scheduling
Desrosiers, J., Dumas, Y., Solomon, M. M., & Soumis, F. (1995) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(05)80106-9 · Cited by 374
Gallo, G., & Pallottino, S. (1988) · Annals of Operations Research · doi:10.1007/bf02288320 · Cited by 352
Heuristic shortest path algorithms for transportation applications: State of the art
Fu, L., Sun, D., & Rilett, L. R. (2006) · Computers & Operations Research · doi:10.1016/j.cor.2005.03.027 · Cited by 341
PHANOTATE: a novel approach to gene identification in phage genomes
McNair, K., Zhou, C., Dinsdale, E. A., Souza, B., & Edwards, R. A. (2019) · Bioinformatics · doi:10.1093/bioinformatics/btz265 · Cited by 328
Finding shortest paths on real road networks: the case for A*
Zeng, W., & Church, R. L. (2009) · International Journal of Geographical Information Science · doi:10.1080/13658810801949850 · Cited by 327
Xu, Y., Quan, R., Xu, W., Huang, Y., Chen, X., & Liu, F. (2024) · Bioengineering · doi:10.3390/bioengineering11101034 · Cited by 310
Δ-stepping: a parallelizable shortest path algorithm
Meyer, U., & Sanders, P. (2003) · Journal of Algorithms · doi:10.1016/s0196-6774(03)00076-2 · Cited by 309
Shortest‐path algorithms: Taxonomy and annotation
Deo, N., & Pang, C. (1984) · Networks · doi:10.1002/net.3230140208 · Cited by 309
McCune, R. R., Weninger, T., & Madey, G. (2015) · ACM Computing Surveys · doi:10.1145/2818185 · Cited by 294
Energy consumption estimation integrated into the Electric Vehicle Routing Problem
Basso, R., Kulcsár, B., Egardt, B., Lindroth, P., & Sanchez-Diaz, I. (2019) · Transportation Research Part D: Transport and Environment · doi:10.1016/j.trd.2019.01.006 · Cited by 290
Machine learning for wireless communications in the Internet of Things: A comprehensive survey
Jagannath, J., Polosky, N., Jagannath, A., Restuccia, F., & Melodia, T. (2019) · Ad Hoc Networks · doi:10.1016/j.adhoc.2019.101913 · Cited by 288
A Survey on the Electric Vehicle Routing Problem: Variants and Solution Approaches
Erdelić, T., & Carić, T. (2019) · Journal of Advanced Transportation · doi:10.1155/2019/5075671 · Cited by 270
Shortest Path Algorithms In Transportation Models: Classical and Innovative Aspects
Pallottino, S., & Scutellà, M. G. (1998) · Equilibrium and Advanced Transportation Modelling · doi:10.1007/978-1-4615-5757-9_11 · Cited by 267
Siraichi, M. Y., Santos, V. F. D., Collange, C., & Pereira, F. M. Q. (2018) · Proceedings of the 2018 International Symposium on Code Generation and Optimization · doi:10.1145/3168822 · Cited by 254
Semiring Frameworks and Algorithms for Shortest-Distance Problems
Mohri, M. (2002) · doi:10.25596/jalc-2002-321 · Cited by 254
Route Planning in Transportation Networks
Bast, H., Delling, D., Goldberg, A., Müller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., & Werneck, R. F. (2015) · arXiv · doi:10.48550/arxiv.1504.05140 · Cited by 189
Modeling Cyber-Physical Vulnerability of the Smart Grid With Incomplete Information
Srivastava, A., Morris, T., Ernster, T., Vellaithurai, C., Pan, S., & Adhikari, U. (2013) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2012.2232318 · Cited by 169
(2004) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 126
Cruising with a Battery-Powered Vehicle and Not Getting Stranded
Storandt, S., & Funke, S. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v26i1.8326 · Cited by 35
QED driven QAOA for network-flow optimization
Zhang, Y., Zhang, R., & Potter, A. C. (2021) · Quantum · doi:10.22331/q-2021-07-27-510 · Cited by 19
Digest: Fast and communication efficient decentralized learning with local updates
Gholami, P., & Seferoglu, H. (2024) · IEEE Transactions on Machine Learning in Communications and Networking · doi:10.1109/tmlcn.2024.3354236 · Cited by 14
Time-dependent Decentralized Routing using Federated Learning
Wilbur, M., Samal, C., Talusan, J. P., Yasumoto, K., & Dubey, A. (2020) · 2020 IEEE 23rd International Symposium on Real-Time Distributed Computing (ISORC) · doi:10.1109/isorc49007.2020.00018 · Cited by 8
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
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.