Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 299

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 access
Matai, Rajesh, Singh, Surya, Lal, Murari·2010·Traveling Salesman Problem, Theory and Applications

Abstract

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.5772/12909

Cites

47 of 47 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 47 references

Cited by

See all 299

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches. https://app.cochat.ai/papers/10.5772/12909
The paper
Matai, R., Singh, S., & Lal, M. (2010). Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches. Traveling Salesman Problem, Theory and Applications. https://doi.org/10.5772/12909

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.