The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
On the worst‐case performance of some algorithms for the asymmetric traveling salesman problem
Abstract
We consider the asymmetric traveling salesman problem for which the triangular inequality is satisfied. For various heuristics we construct examples to show that the worst‐case ratio of length of tour found to minimum length tour is (n) for n city problems. We also provide a new O([log 2n]) heuristic.
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
(1979) · Cited by 43,841
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
Clarke, G., & Wright, J. W. (1964) · Operations Research · doi:10.1287/opre.12.4.568 · Cited by 3,894
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
Lin, S., & Kernighan, B. W. (1973) · Operations Research · doi:10.1287/opre.21.2.498 · Cited by 3,821
Computer Solutions of the Traveling Salesman Problem
Lin, S. (1965) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1965.tb04146.x · Cited by 1,986
P-Complete Approximation Problems
Sahni, S., & Gonzalez, T. (1976) · Journal of the ACM · doi:10.1145/321958.321975 · Cited by 1,703
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
Matroids and the greedy algorithm
Edmonds, J. (1971) · Mathematical Programming · doi:10.1007/bf01584082 · Cited by 866
A Heuristic Approach to Solving Travelling Salesman Problems
Karg, R. L., & Thompson, G. L. (1964) · Management Science · doi:10.1287/mnsc.10.2.225 · Cited by 210
Cited by
Routing and scheduling of vehicles and crews
Raff, S. (1983) · Computers & Operations Research · doi:10.1016/0305-0548(83)90030-8 · Cited by 867
Osaba, E., Villar-Rodriguez, E., Oregi, I., & Moreno-Fernandez-de-Leceta, A. (2021) · Proceedings of the Genetic and Evolutionary Computation Conference Companion · doi:10.1145/3449726.3463123 · Cited by 20
Metadata
- Authors
- Frieze, A. M., Galbiati, G., & Maffioli, F.
- Venue
- Networks
- Publisher
- Wiley
- Published
- 1982-03
- Volume
- 12
- Issue
- 1
- Pages
- 23-39
- ISSN
- 0028-3045 (ISSN-L)
- 1097-0037
- OpenAlex
- W2035610952
- Cited by
- 252
- References
- 14
- FWCI
- 0.60
- 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: On the worst‐case performance of some algorithms for the asymmetric traveling salesman problem. https://app.cochat.ai/papers/10.1002/net.3230120103
- The paper
- Frieze, A. M., Galbiati, G., & Maffioli, F. (1982). On the worst‐case performance of some algorithms for the asymmetric traveling salesman problem. Networks. https://doi.org/10.1002/net.3230120103
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.