On the stability of the travelling salesman problem algorithm of Hopfield and Tank (Q1098576)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the stability of the travelling salesman problem algorithm of Hopfield and Tank |
scientific article; zbMATH DE number 4039158
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the stability of the travelling salesman problem algorithm of Hopfield and Tank |
scientific article; zbMATH DE number 4039158 |
Statements
On the stability of the travelling salesman problem algorithm of Hopfield and Tank (English)
0 references
1988
0 references
The application of the method of \textit{J. J. Hopfield} and \textit{D. W. Tank} to the travelling salesman problem [ibid, 52, 141-152 (1985; Zbl 0572.68041)] is re-examined in an effort to find a procedure for scaling to system sizes of real interest. As this failed, methods were tried to improve the algorithm, recognizing the importance of a ``silicon implementation''. No satisfactory refinement was found, and the reasons for algorithm failure are identified.
0 references
stability
0 references
travelling salesman problem
0 references
scaling
0 references
algorithm
0 references
refinement
0 references
