An Hopfield network learning for minimum vertex cover problem

Xiaohong Chen, Zheng Tang, Xin-Shun Xu, Songsong Li, Guangpu Xia, Ziliang Zong, Jiahai WangSociety 2004 · DOI

Abstract

An algorithm for the minimum vertex cover problem based on HNN leaning is presented. The network phase performs gradient descent in state domain, and finds a set of states minimizing the HNN's energy. When the HNN gets stuck, the learning phase is performed to fill up the local minimum valley by modifying parameter in gradient ascent direction of the energy.
BibTeX
@inproceedings{chen2004hopfield,
  author = {Xiaohong Chen and Zheng Tang and Xin-Shun Xu and Songsong Li and Guangpu Xia and Ziliang Zong and Jiahai Wang},
  title = {{An Hopfield network learning for minimum vertex cover problem}},
  booktitle = {Society},
  year = {2004},
  doi = {10.11499/sicep.2004.0\_80\_3},
}

Loading related content...

Figure