Improving the Hopfield model performance when applied to the traveling salesman problem. A divide-and-conquer scheme
DOI10.1007/S00500-016-2039-8zbMATH Open1381.68281OpenAlexW2271688446MaRDI QIDQ1701902FDOQ1701902
Authors: Lucas García, Pedro M. Talaván, 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
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- A learning method in Hopfield neural network for combinatorial optimization problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Neurons with graded response have collective computational properties like those of two-state neurons
- The Euclidean traveling salesman problem is NP-complete
- ``Neural computation of decisions in optimization problems
- On the stability of the travelling salesman problem algorithm of Hopfield and Tank
- The traveling salesman. Computational solutions for RSP applications
- A review of Hopfield neural networks for solving mathematical programming problems
- Neural networks: computational models and applications.
- On the performance of the LP-guided Hopfield network-genetic algorithm
- Solving large scale combinatorial optimization problems based on a divide and conquer strategy
- A continuous Hopfield network equilibrium points algorithm
- The generalized quadratic knapsack problem. A neuronal network approach
- On parameter settings of Hopfield networks applied to traveling salesman problems
- An efficient multivalued Hopfield network for the traveling salesman problem
- Necessary and sufficient condition for multistability of neural networks evolving on a closed hypercube
Cited In (5)
- A novel fractional-order memristive Hopfield neural network for traveling salesman problem and its FPGA implementation
- Optimizing hyperparameters in Hopfield neural networks using evolutionary search
- IMPROVED PROJECTION HOPFIELD NETWORK FOR THE QUADRATIC ASSIGNMENT PROBLEM
- Title not available (Why is that?)
- Novel method to solve TSP by continuous Hopfield neural network
Uses Software
This page was built for publication: Improving the Hopfield model performance when applied to the traveling salesman problem. A divide-and-conquer scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1701902)
