Improving the Hopfield model performance when applied to the traveling salesman problem. A divide-and-conquer scheme
DOI10.1007/s00500-016-2039-8zbMath1381.68281OpenAlexW2271688446MaRDI QIDQ1701902
Pedro M. Talaván, Lucas García, Javier Yáñez
Publication date: 27 February 2018
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-016-2039-8
Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Neural networks: computational models and applications.
- On the performance of the LP-guided Hopfield network-genetic algorithm
- A review of Hopfield neural networks for solving mathematical programming problems
- ``Neural computation of decisions in optimization problems
- On the stability of the travelling salesman problem algorithm of Hopfield and Tank
- The Euclidean traveling salesman problem is NP-complete
- Solving large scale combinatorial optimization problems based on a divide and conquer strategy
- The traveling salesman. Computational solutions for RSP applications
- A learning method in Hopfield neural network for combinatorial optimization problem
- Necessary and sufficient condition for multistability of neural networks evolving on a closed hypercube
- A continuous Hopfield network equilibrium points algorithm
- The generalized quadratic knapsack problem. A neuronal network approach
- TSPLIB—A Traveling Salesman Problem Library
- On parameter settings of Hopfield networks applied to traveling salesman problems
- Neurons with graded response have collective computational properties like those of two-state neurons.
- An efficient multivalued Hopfield network for the traveling salesman problem
This page was built for publication: Improving the Hopfield model performance when applied to the traveling salesman problem. A divide-and-conquer scheme
