The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
On the stability of the Travelling Salesman Problem algorithm of Hopfield and Tank
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
“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 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
Cited by
A graduated assignment algorithm for graph matching
Gold, S., & Rangarajan, A. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.491619 · Cited by 1,090
Elements of Artificial Neural Networks
Mehrotra, K., Mohan, C., & Ranka, S. (1996) · The MIT Press eBooks · doi:10.7551/mitpress/2687.001.0001 · Cited by 912
Metaheuristics: A bibliography
Osman, I. H., & Laporte, G. (1996) · Annals of Operations Research · doi:10.1007/bf02125421 · Cited by 672
Chaotic simulated annealing by a neural network model with transient chaos
Chen, L., & Aihara, K. (1995) · Neural Networks · doi:10.1016/0893-6080(95)00033-v · Cited by 661
New algorithms for 2D and 3D point matching
Gold, S., Rangarajan, A., Lu, C.-P., Pappu, S., & Mjolsness, E. (1998) · Pattern Recognition · doi:10.1016/s0031-3203(98)80010-1 · Cited by 580
Economic load dispatch for piecewise quadratic cost function using Hopfield neural network
Park, J. H., Kim, Y. S., Eom, I. K., & Lee, K. Y. (1993) · IEEE Transactions on Power Systems · doi:10.1109/59.260897 · Cited by 408
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
A theoretical investigation into the performance of the Hopfield model
Aiyer, S. V. B., Niranjan, M., & Fallside, F. (1990) · IEEE Transactions on Neural Networks · doi:10.1109/72.80232 · Cited by 381
Neural Networks for Pattern Recognition
Kothari, S. C., & Oh, H. (1993) · Advances in Computers · doi:10.1016/s0065-2458(08)60404-0 · Cited by 316
Neural-net computing and the intelligent control of systems
PAO, Y.-H., PHILLIPS, S. M., & SOBAJIC, D. J. (1992) · International Journal of Control · doi:10.1080/00207179208934315 · Cited by 307
A neural network model as a globally coupled map and applications based on chaos
Nozawa, H. (1992) · Chaos: An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.165880 · Cited by 280
Hopfield neural networks for optimization: study of the different dynamics
Joya, G., Atencia, M. A., & Sandoval, F. (2002) · Neurocomputing · doi:10.1016/s0925-2312(01)00337-x · Cited by 276
Neural networks for shortest path computation and routing in computer networks
Ali, M. K. M., & Kamoun, F. (1993) · IEEE Transactions on Neural Networks · doi:10.1109/72.286889 · Cited by 272
Metadata
- Authors
- Wilson, G. V., & Pawley, G. S.
- Venue
- Biological Cybernetics
- Published
- 1988-01
- Volume
- 58
- Issue
- 1
- Pages
- 63-70
- ISSN
- 0340-1200 (ISSN-L)
- 1432-0770
- OpenAlex
- W2010863474
- Cited by
- 546
- References
- 3
- FWCI
- 34.37
- 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
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.