An improved optimal competitive Hopfield network for bipartite subgraph problems

摘要

The bipartite subgraph problem is a classical problem in combinatorial optimization. Recently, Galan-Marin et al. proposed an optimal competitive Hopfield model (OCHOM) for this problem. In this paper, we propose a new algorithm that permits temporary energy increases and includes stochastic dynamics. The new algorithm helps the OCHOM escape from local minima. A number of instances have been simulated to verify the proposed algorithm.