By Topic

Theoretical characterizations of possibilities and impossibilities of Hopfield neural networks in solving combinatorial optimization problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Matsuda, S. ; Comput. & Commun. Res. Center, Tokyo Electr. Power Co. Inc., Japan

The asymptotical stability and instability conditions of the solutions and nonsolutions are proved for corners of Hopfield neural hypercube in solving typical combinatorial optimization problems, i.e., traveling salesman problem, N-queen problem and Hitchcock problem. These conditions make the theoretical characterizations of many possibilities and impossibilities of Hopfield neural networks in solving combinatorial optimization problems

Published in:

Neural Networks, 1994. IEEE World Congress on Computational Intelligence., 1994 IEEE International Conference on  (Volume:7 )

Date of Conference:

27 Jun-2 Jul 1994