期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2006
卷号：6
期号：9B
页码：28-31
出版社：International Journal of Computer Science and Network Security
摘要：The minimum set cover problem (MSCP) is an important NP-hard problem. In this paper, we propose a learning algorithm of the Hopfield neural network which can escape from local minima, for efficiently solving the problem. Extensive simulations are performed, and the simulation results show that the proposed learning algorithm works much better than the other existing algorithms on random instances of hypergraphs
关键词：Hopfield neural network, Learning algorithm, Minimum set cover problem, NP-complete problem
