The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Self-organizing feature maps and the travelling salesman problem
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
Learning representations by back-propagating errors
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1986) · Nature · doi:10.1038/323533a0 · Cited by 31,892
Self-Organization and Associative Memory
Kohonen, T. (1989) · Springer Series in Information Sciences · doi:10.1007/978-3-642-88163-3 · Cited by 8,740
“Neural” computation of decisions in optimization problems
Hopfield, J. J., & Tank, D. W. (1985) · Biological Cybernetics · doi:10.1007/bf00339943 · Cited by 6,031
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
Feature Discovery by Competitive Learning*
Rumelhart, D. E., & Zipser, D. (1985) · Cognitive Science · doi:10.1207/s15516709cog0901_5 · Cited by 1,057
Feature discovery by competitive learning
RUMELHART, D., & ZIPSER, D. (1985) · Cognitive Science · doi:10.1016/s0364-0213(85)80010-0 · Cited by 882
An analogue approach to the travelling salesman problem using an elastic net method
Durbin, R., & Willshaw, D. (1987) · Nature · doi:10.1038/326689a0 · Cited by 797
Learning internal representations by back-propagating errors
Rumelhart, D. E. (1986) · Medical Entomology and Zoology · Cited by 337
Modèles connexionnistes de l'apprentissage
Le Cun, Y., & Fogelman-Soulié, F. (1987) · Intellectica. Revue de l'Association pour la Recherche Cognitive · doi:10.3406/intel.1987.1804 · Cited by 185
Dynamical Systems and Cellular Automata
Demongeot, J., Goles, É., & Tchuenté, M. (1985) · Medical Entomology and Zoology · Cited by 153
Cited by
Kohonen, T. (1990) · Proceedings of the IEEE · doi:10.1109/5.58325 · Cited by 8,414
Metaheuristics: A bibliography
Osman, I. H., & Laporte, G. (1996) · Annals of Operations Research · doi:10.1007/bf02125421 · Cited by 672
Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
Smith, K. A. (1999) · INFORMS Journal on Computing · doi:10.1287/ijoc.11.1.15 · Cited by 401
Heuristics from nature for hard combinatorial optimization problems
Colorni, A. (1996) · International Transactions in Operational Research · doi:10.1016/0969-6016(96)00004-4 · Cited by 288
Chen, S.-M., & Chien, C.-Y. (2011) · Expert Systems with Applications · doi:10.1016/j.eswa.2011.04.163 · Cited by 254
Metadata
- Authors
- Angéniol, B., de La Croix Vaubois, G., & Le Texier, J.-Y.
- Venue
- Neural Networks
- Publisher
- Elsevier BV
- Published
- 1988-01
- Volume
- 1
- Issue
- 4
- Pages
- 289-293
- ISSN
- 0893-6080 (ISSN-L)
- OpenAlex
- W2033320243
- Cited by
- 340
- References
- 11
- FWCI
- 9.94
- 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: Self-organizing feature maps and the travelling salesman problem. https://app.cochat.ai/papers/10.1016/0893-6080(88)90002-0
- The paper
- Angéniol, B., de La Croix Vaubois, G., & Le Texier, J.-Y. (1988). Self-organizing feature maps and the travelling salesman problem. Neural Networks. https://doi.org/10.1016/0893-6080(88)90002-0
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.