Improved exploration in Hopfield network state-space through parameter perturbation driven by simulated annealing
DOI10.1016/S0377-2217(97)00375-5zbMATH Open0957.90019OpenAlexW2026690896MaRDI QIDQ1296032FDOQ1296032
Authors: V. Pereyra 
Publication date: 2 April 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00375-5
Recommendations
- scientific article
- Managing spatio-temporal complexity in Hopfield neural network simulations for large-scale static optimization.
- scientific article; zbMATH DE number 41891
- Efficiency comparison of Hopfield network with simulated annealing as optimization methods for solving the traveling salesman problem
- On parameter settings of Hopfield networks applied to traveling salesman problems
- Hopfield neural networks for optimization: Study of the different dynamics
- An improved learning algorithm for discrete Hopfield
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Neural networks for/in biological studies, artificial life and related topics (92B20)
Cites Work
- Optimization by simulated annealing
- Equation of state calculations by fast computing machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Neural networks and physical systems with emergent collective computational abilities
- ``Neural computation of decisions in optimization problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the approximation of NP-complete problems by using the Boltzmann machine method: the cases of some covering and packing problems
Cited In (1)
This page was built for publication: Improved exploration in Hopfield network state-space through parameter perturbation driven by simulated annealing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296032)
