On parameter settings of Hopfield networks applied to traveling salesman problems

DOI10.1109/TCSI.2005.846666MaRDI QIDQ4590451zbMATH OpenOpenAlexWikidataFDO

Authors Kay Chen Tan, Hua Jin Tang, Shuzhi Sam Ge

Publication date 20 November 2017

Published in IEEE Transactions on Circuits and Systems I: Regular Papers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tcsi.2005.846666

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stability of solutions to ordinary differential equations (34D20) Neural nets applied to problems in time-dependent statistical mechanics (82C32)

Cited in

(8)

• scientific article; zbMATH DE number 5009008 (Why is no real title available?)
• Parameter tuning of continuous Hopfield network applied to combinatorial optimization
• Optimizing hyperparameters in Hopfield neural networks using evolutionary search
• Locally optimal algorithms for designing schedules based on Hopfield networks
• Improved exploration in Hopfield network state-space through parameter perturbation driven by simulated annealing
• A review of Hopfield neural networks for solving mathematical programming problems
• Mapping a logical representation of TSP to quantum annealing
• Improving the Hopfield model performance when applied to the traveling salesman problem. A divide-and-conquer scheme

This page was built for publication: On parameter settings of Hopfield networks applied to traveling salesman problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4590451)