The DOI matches its Crossref record.
A Heuristic Approach to Solving Travelling Salesman Problems
Abstract
A code for solving travelling salesman problem employing heuristic ideas is described. Acyclic permutations of the cities are constructed by first choosing two cities at random for a permutation of length two, putting the remaining cities in a random list and then inserting cities from the list in the partially constructed permutations so that they add least to the length of the partial tour. A second heuristic idea used in the code is that of breaking up the problem into convex, or almost convex sub-problems and employing the above-mentioned heuristic on these subproblems. Numerical experience with the code is described as well as weaknesses and strengths of the method.
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
Cited by
Validation of subgradient optimization
Held, M., Wolfe, P., & Crowder, H. P. (1974) · Mathematical Programming · doi:10.1007/bf01580223 · Cited by 1,362
The traveling-salesman problem and minimum spanning trees: Part II
Held, M., & Karp, R. M. (1971) · Mathematical Programming · doi:10.1007/bf01584070 · Cited by 1,018
Routing and scheduling of vehicles and crews
Raff, S. (1983) · Computers & Operations Research · doi:10.1016/0305-0548(83)90030-8 · Cited by 867
An Analysis of Several Heuristics for the Traveling Salesman Problem
Rosenkrantz, D. J., Stearns, R. E., & Lewis, II (1977) · SIAM Journal on Computing · doi:10.1137/0206041 · Cited by 837
An analysis of several heuristics for the traveling salesman problem
Rosenkrantz, D. J., Stearns, R. E., & Lewis, P. M. (2009) · Fundamental Problems in Computing · doi:10.1007/978-1-4020-9688-4_3 · Cited by 772
Metadata
- Authors
- Karg, R. L., & Thompson, G. L.
- Venue
- Management Science
- Published
- 1964-01
- Volume
- 10
- Issue
- 2
- Pages
- 225-248
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W2056898464
- Cited by
- 210
- References
- 0
- FWCI
- 123.23
- 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 Heuristic Approach to Solving Travelling Salesman Problems. https://app.cochat.ai/papers/10.1287/mnsc.10.2.225
- The paper
- Karg, R. L., & Thompson, G. L. (1964). A Heuristic Approach to Solving Travelling Salesman Problems. Management Science. https://doi.org/10.1287/mnsc.10.2.225
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.