On the stability of the travelling salesman problem algorithm of Hopfield and Tank (Q1098576)

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.