Improving the Hopfield model performance when applied to the traveling salesman problem. A divide-and-conquer scheme (Q1701902)
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: Improving the Hopfield model performance when applied to the traveling salesman problem. A divide-and-conquer scheme |
scientific article; zbMATH DE number 6844196
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improving the Hopfield model performance when applied to the traveling salesman problem. A divide-and-conquer scheme |
scientific article; zbMATH DE number 6844196 |
Statements
Improving the Hopfield model performance when applied to the traveling salesman problem. A divide-and-conquer scheme (English)
0 references
27 February 2018
0 references
artificial neural networks
0 references
Hopfield network
0 references
traveling salesman problem
0 references
divide-and-conquer
0 references
0 references
0 references
0 references
0.8206520080566406
0 references
0.7917149662971497
0 references
0.7851449251174927
0 references
0.7851449251174927
0 references
