TY  - JOUR
AU  - García Rodriguez, Lucas
AU  - Talaván, Pedro M.
AU  - Yáñez, Javier
PY  - 2016
DO  - 10.1007/s00500-016-2039-8
SN  - 1432-7643
UR  - https://hdl.handle.net/20.500.14352/24399
T2  - Soft Computing
AB  - The continuous Hopfield network (CHN) can be used to solve, among other combinatorial optimization problems, the traveling salesman problem (TSP). In order to improve the performance of this heuristic technique, a divide-and-conquer strategy based on...
LA  - eng
M2  - 1
PB  - Springer-Verlag
KW  - Artificial neural networks
KW  - Hopfield network
KW  - Traveling salesman problem
KW  - Divide-and-conquer.
TI  - Improving the Hopfield model performance when applied to the traveling salesman problem: A divide-and-conquer scheme
TY  - journal article
ER  -