On the performance of the LP-guided Hopfield network-genetic algorithm

DOI10.1016/j.cor.2008.08.012zbMath1158.90398OpenAlexW2059051640MaRDI QIDQ1013398

Emilio G. Ortiz-García, Sancho Salcedo-Sanz, Ángel M. Pérez-Bellido, Antonio Portilla-Figueras, Francisco López-Ferreras

Publication date: 17 April 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.08.012

zbMATH Keywords

linear programmingheuristicshybrid genetic algorithmsHopfield networks

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Neural networks for/in biological studies, artificial life and related topics (92B20)

Related Items (2)

Improving the Hopfield model performance when applied to the traveling salesman problem. A divide-and-conquer scheme ⋮ Mixed Tabu machine for portfolio optimization problem

Cites Work

• Unnamed Item
• Unnamed Item
• A portable and scalable algorithm for a class of constrained combinatorial optimization problems
• Neural networks and physical systems with emergent collective computational abilities.

This page was built for publication: On the performance of the LP-guided Hopfield network-genetic algorithm