Theoretical characterizations of possibilities and impossibilitiesof Hopfield neural networks in solving combinatorial optimizationproblems

摘要

The asymptotical stability and instability conditions of thensolutions and nonsolutions are proved for corners of Hopfield neuralnhypercube in solving typical combinatorial optimization problems, i.e.,ntraveling salesman problem, N-queen problem and Hitchcock problem. Thesenconditions make the theoretical characterizations of many possibilitiesnand impossibilities of Hopfield neural networks in solving combinatorialnoptimization problems