The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
A note on the prize collecting traveling salesman problem
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
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
(1986) · Journal of the Operational Research Society · doi:10.1057/jors.1986.93 · Cited by 1,679
The Traveling-Salesman Problem and Minimum Spanning Trees
Held, M., & Karp, R. M. (1970) · Operations Research · doi:10.1287/opre.18.6.1138 · Cited by 1,440
Combinatorial Problems and Exercises
(1993) · Elsevier eBooks · doi:10.1016/c2009-0-09109-0 · Cited by 1,312
Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem
Christofides, N. (2022) · Operations Research Forum · doi:10.1007/s43069-021-00101-z · Cited by 1,131
Cited by
The Design of Approximation Algorithms
Williamson, D. P., & Shmoys, D. B. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921735 · Cited by 1,301
Self-citationGeometric Shortest Paths and Network Optimization
Mitchell, J. S. B. (2000) · Handbook of Computational Geometry · doi:10.1016/b978-044482537-7/50016-4 · Cited by 427
Approximation algorithms for the geometric covering salesman problem
Arkin, E. M., & Hassin, R. (1994) · Discrete Applied Mathematics · doi:10.1016/0166-218x(94)90008-6 · Cited by 356
CytoTalk: De novo construction of signal transduction networks using single-cell transcriptomic data
Hu, Y., Peng, T., Gao, L., & Tan, K. (2021) · Science Advances · doi:10.1126/sciadv.abf1356 · Cited by 136
Metadata
- Authors
- Bienstock, D., Goemans, M. X., Simchi-Levi, D., & Williamson, D.
- Venue
- Mathematical Programming
- Published
- 1993-03
- Volume
- 59
- Issue
- 1-3
- Pages
- 413-420
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2044119054
- Cited by
- 280
- References
- 4
- FWCI
- 7.53
- 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
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.
