Presentation	1996/5/24 Third Order Hopfield Network Sharply Distinguishing Optimal Solutions of TSP Satoshi Matsuda,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	Taking traveling salesman problem as an example of combinatorial optimization problems mapped by quadratic cost function, its mapping on third order Hopfield network is presented where a corner of state hypercube of the network is asymptotically stable if and only if it is an optimal solution. That is, one can always get optimal solution whenever the network converges to a corner. By simulations it is shown that optimal solutions are obtained very frequently. This mapping is possible for many combinatorial optimization problems with quadratic cost function as well as traveling salesman problems. Thus it makes the importance of third order Hopfield networks for combinatorial optimization theoretically clear.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	third oredr Hopfield network / traveling salesman problem / optimal neural representation
Paper #	NC96-8
Date of Issue

Conference Information
Committee	NC
Conference Date	1996/5/24(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Neurocomputing (NC)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Third Order Hopfield Network Sharply Distinguishing Optimal Solutions of TSP
Sub Title (in English)
Keyword(1)	third oredr Hopfield network
Keyword(2)	traveling salesman problem
Keyword(3)	optimal neural representation
1st Author's Name	Satoshi Matsuda
1st Author's Affiliation	Computer and Communication Research Center, Tokyo Electric Power Company()
Date	1996/5/24
Paper #	NC96-8
Volume (vol)	vol.96
Number (no)	76
Page	pp.pp.-
#Pages	8
Date of Issue