The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
A new implementation of Yen?s ranking loopless paths algorithm
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
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 24,043
Finding the K Shortest Loopless Paths in a Network
Yen, J. Y. (1971) · Management Science · doi:10.1287/mnsc.17.11.712 · Cited by 2,618
Eppstein, D. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539795290477 · Cited by 1,381
An Appraisal of Some Shortest-Path Algorithms
Dreyfus, S. E. (1969) · Operations Research · doi:10.1287/opre.17.3.395 · Cited by 1,002
Lawler, E. L. (1972) · Management Science · doi:10.1287/mnsc.18.7.401 · Cited by 431
An algorithm for ranking paths that may contain cycles
Martins, E. D. Q. V. (1984) · European Journal of Operational Research · doi:10.1016/0377-2217(84)90269-8 · Cited by 92
Self-citation
Cited by
Gouti, M., Delile, J., Stamataki, D., Wymeersch, F. J., Huang, Y., Kleinjung, J., Wilson, V., & Briscoe, J. (2017) · Developmental Cell · doi:10.1016/j.devcel.2017.04.002 · Cited by 261
Sagner, A., Gaber, Z. B., Delile, J., Kong, J. H., Rousso, D. L., Pearson, C. A., Weicksel, S. E., Melchionda, M., Mousavy Gharavy, S. N., Briscoe, J., et al. (2018) · PLoS Biology · doi:10.1371/journal.pbio.2003127 · Cited by 96
Metadata
- Authors
- Martins, E. V., & Pascoal, M. B.
- Venue
- Quarterly Journal of the Belgian, French and Italian Operations Research Societies
- Published
- 2003-06
- Volume
- 1
- Issue
- 2
- ISSN
- 1614-2411 (ISSN-L)
- 1619-4500
- OpenAlex
- W2052120747
- Cited by
- 283
- References
- 6
- FWCI
- 5.46
- 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: A new implementation of Yen?s ranking loopless paths algorithm. https://app.cochat.ai/papers/10.1007/s10288-002-0010-2
- The paper
- Martins, E. V., & Pascoal, M. B. (2003). A new implementation of Yen?s ranking loopless paths algorithm. Quarterly Journal of the Belgian, French and Italian Operations Research Societies. https://doi.org/10.1007/s10288-002-0010-2
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.