On the stability of the travelling salesman problem algorithm of Hopfield and Tank (Q1098576): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q52253214, #quickstatements; #temporary_batch_1711094041063 |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q3674026 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: ``Neural'' computation of decisions in optimization problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimization by Simulated Annealing / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf00363956 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2010863474 / rank | |||
Normal rank | |||
Latest revision as of 10:00, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the stability of the travelling salesman problem algorithm of Hopfield and Tank |
scientific article |
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
