The DOI matches its Crossref record; 47 of the 47 references it cites were found in a registry or an index.
Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches
Open accessAbstract
ii x y and rs d is the Euclidean distance between r and s
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
(2002) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718515 · Cited by 4,008
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
(2003) · Selected Papers of Alan J Hoffman · doi:10.1142/9789812796936_others05 · Cited by 2,465
Ant colonies for the travelling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · Biosystems · doi:10.1016/s0303-2647(97)01708-5 · Cited by 2,023
Integer Programming Formulation of Traveling Salesman Problems
Miller, C. E., Tucker, A. W., & Zemlin, R. A. (1960) · Journal of the ACM · doi:10.1145/321043.321046 · Cited by 2,020
Branch-and-Bound Methods: A Survey
Lawler, E. L., & Wood, D. E. (1966) · Operations Research · doi:10.1287/opre.14.4.699 · Cited by 1,997
An Automatic Method for Solving Discrete Programming Problems
Land, A. H., & Doig, A. G. (2010) · 50 Years of Integer Programming 1958-2008 · doi:10.1007/978-3-540-68279-0_5 · Cited by 1,988
An Automatic Method of Solving Discrete Programming Problems
Land, A. H., & Doig, A. G. (1960) · Econometrica · doi:10.2307/1910129 · Cited by 1,942
The vehicle routing problem: An overview of exact and approximate algorithms
Laporte, G. (1992) · European Journal of Operational Research · doi:10.1016/0377-2217(92)90192-c · Cited by 1,749
The Traveling salesman problem: a computational study
(2007) · Choice Reviews Online · doi:10.5860/choice.45-0928 · Cited by 1,726
Maximum matching and a polyhedron with 0,1-vertices
Edmonds, J. (1965) · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · doi:10.6028/jres.069b.013 · Cited by 1,712
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
An effective implementation of the Lin–Kernighan traveling salesman heuristic
Helsgaun, K. (2000) · European Journal of Operational Research · doi:10.1016/s0377-2217(99)00284-2 · Cited by 1,630
The Traveling Salesman Problem
(2019) · Fundamentals of Supply Chain Theory · doi:10.1002/9781119584445.ch10 · Cited by 1,614
Solution of a Large-Scale Traveling-Salesman Problem
Dantzig, G. B., Fulkerson, R., & Johnson, S. M. (1954) · Journal of the Operations Research Society of America · doi:10.1287/opre.2.4.393 · Cited by 1,483
Burkard, R., Dell'Amico, M., & Martello, S. (2009) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898717754 · Cited by 1,394
The Traveling Salesman Problem and Its Variations
(2007) · Combinatorial Optimization · doi:10.1007/b101971 · Cited by 1,392
Solution of a Large-Scale Traveling-Salesman Problem
Chvátal, V., Cook, W. J., Dantzig, G. B., Fulkerson, D. R., & Johnson, S. M. (2009) · Springer eBooks · doi:10.1007/978-3-540-68279-0_1 · Cited by 1,263
The multiple traveling salesman problem: an overview of formulations and solution procedures
Bektas, T. (2006) · Omega · doi:10.1016/j.omega.2004.10.004 · Cited by 1,153
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Arora, S. (1998) · Journal of the ACM · doi:10.1145/290179.290180 · Cited by 1,137
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
Padberg, M., & Rinaldi, G. (1991) · SIAM Review · doi:10.1137/1033004 · Cited by 1,097
An Algorithm for the Traveling Salesman Problem
Little, J. D. C., Murty, K. G., Sweeney, D. W., & Karel, C. (1963) · Operations Research · doi:10.1287/opre.11.6.972 · Cited by 1,058
The traveling salesman problem: An overview of exact and approximate algorithms
Laporte, G. (1992) · European Journal of Operational Research · doi:10.1016/0377-2217(92)90138-y · Cited by 971
Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
Ratliff, H. D., & Rosenthal, A. S. (1983) · Operations Research · doi:10.1287/opre.31.3.507 · Cited by 628
The Traveling Salesman Problem: A Case Study in Local Optimization
Johnson, D. S., & McGeoch, L. A. (2008) · Cited by 595
Opportunities for OR in intermodal freight transport research: A review
Macharis, C., & Bontekoning, Y. M. (2004) · European Journal of Operational Research · doi:10.1016/s0377-2217(03)00161-9 · Cited by 577
Christofides, N., Mingozzi, A., & Toth, P. (1981) · Mathematical Programming · doi:10.1007/bf01589353 · Cited by 535
Biggs, N. L., Lloyd, E. K., & Wilson, R. J. (1976) · Medical Entomology and Zoology · Cited by 377
Experimental Analysis of Heuristics for the STSP
Johnson, D. S., & McGeoch, L. A. (2007) · Combinatorial Optimization · doi:10.1007/0-306-48213-4_9 · Cited by 339
Optimal Routing under Capacity and Distance Restrictions
Laporte, G., Nobert, Y., & Desrochers, M. (1985) · Operations Research · doi:10.1287/opre.33.5.1050 · Cited by 307
Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows
Mitrović-Minić, S., Krishnamurti, R., & Laporte, G. (2004) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2003.09.001 · Cited by 299
Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
Crowder, H., & Padberg, M. W. (1980) · Management Science · doi:10.1287/mnsc.26.5.495 · Cited by 294
The traveling salesman problem on a graph and some related integer polyhedra
Cornuéjols, G., Fonlupt, J., & Naddef, D. (1985) · Mathematical Programming · doi:10.1007/bf01582008 · Cited by 280
Some Simple Applications of the Travelling Salesman Problem
Lenstra, J. K., & Kan, A. H. G. R. (1975) · Journal of the Operational Research Society · doi:10.1057/jors.1975.151 · Cited by 270
A comparative analysis of several asymmetric traveling salesman problem formulations
Öncan, T., Altınel, İ. K., & Laporte, G. (2009) · Computers & Operations Research · doi:10.1016/j.cor.2007.11.008 · Cited by 215
Certification of an optimal TSP tour through 85,900 cities
Applegate, D. L., Bixby, R. E., Chvátal, V., Cook, W., Espinoza, D. G., Goycoolea, M., & Helsgaun, K. (2009) · Operations Research Letters · doi:10.1016/j.orl.2008.09.006 · Cited by 175
Computer-Assisted School Bus Scheduling
Angel, R., Caudle, W. L., Noonan, R. E., & Whinston, A. B. (1972) · Management Science · doi:10.1287/mnsc.18.6.b279 · Cited by 133
Reactive Tabu Search in unmanned aerial reconnaissance simulations
Ryan, J. L., Bailey, T. G., Moore, J. T., & Carlton, W. B. (2002) · Winter Simulation Conference · doi:10.1109/wsc.1998.745084 · Cited by 130
Algorithms and codes for dense assignment problems: the state of the art
Dell’Amico, M., & Toth, P. (2000) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(99)00172-9 · Cited by 117
GRAMMPS: a generalized mission planner for multiple mobile robots in unstructured environments
Brumitt, B. L., & Stentz, A. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1998.677360 · Cited by 115
Exact solution of large-scale, asymmetric traveling salesman problems
Carpaneto, G., Dell’Amico, M., & Toth, P. (1995) · ACM Transactions on Mathematical Software · doi:10.1145/212066.212081 · Cited by 114
Dynamic Mission Planning for Multiple Mobile Robots
Brumitt, B. L., & Stentz, A. (1997) · Springer eBooks · doi:10.1007/978-1-4615-6325-9_12 · Cited by 109
An additive bounding procedure for the asymmetric travelling salesman problem
Fischetti, M., & Toth, P. (1992) · Mathematical Programming · doi:10.1007/bf01585701 · Cited by 87
The design of the global navigation satellite system surveying networks using genetic algorithms
Saleh, H. A., & Chelouah, R. (2003) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2003.11.001 · Cited by 83
A neural network algorithm for the multiple traveling salesmen problem
Wacholder, E., Han, J., & Mann, R. C. (1989) · Biological Cybernetics · doi:10.1007/bf00204755 · Cited by 78
Scheduling pre-printed newspaper advertising inserts using genetic algorithms
Carter, A. E., & Ragsdale, C. T. (2002) · Omega · doi:10.1016/s0305-0483(02)00059-2 · Cited by 70
Extended simulated annealing for augmented TSP and multi-salesmen TSP
Song, C., Lee, K., & Lee, K. M. (2004) · doi:10.1109/ijcnn.2003.1223777 · Cited by 66
Cited by
Algorithm for DNA sequence assembly by quantum annealing
Nałęcz-Charkiewicz, K., & Nowak, R. M. (2022) · BMC Bioinformatics · doi:10.1186/s12859-022-04661-7 · Cited by 37
CodeEvolve: an open source evolutionary coding agent for algorithmic discovery and optimization
Assumpção, H., Ferreira, D., Campos, L., & Murai, F. (2025) · arXiv · doi:10.48550/arxiv.2510.14150
Metadata
- Authors
- Matai, R., Singh, S., & Lal, M.
- Venue
- Traveling Salesman Problem, Theory and Applications
- Publisher
- InTech
- Published
- 2010-11-30
- OpenAlex
- W1561418801
- Cited by
- 299
- References
- 47
- FWCI
- 17.44
- Type
- book chapter
- Language
- en
- Open access
- hybrid
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.