An algorithm for the traveling salesman problem.¶
Little, J. D. C., Murty, K. G., Sweeney, D. W., & Karel, C. (1963). An algorithm for the traveling salesman problem. Operations Research, 11(6), 972-989.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Branch and Bound
- Earlier work by Dantzig-Fulkerson-Johnson (1954) on the traveling salesman problem used cutting-plane methods with elements of the framework.
This sourcefirst explicit application of branch-and-bound to TSP and the paper that introduced the 'branch and bound' terminology (branching into subsets, lower bound per subset).
- Earlier work by Dantzig-Fulkerson-Johnson (1954) on the traveling salesman problem used cutting-plane methods with elements of the framework.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:94dbd4442775 · see in the full table