A saturation binary neural network for bipartite subgraph problem

Authors:
Cui Zhang;Li-Qing Zhao;Rong-Long Wang
Affiliations:
Department of Autocontrol, Liaoning Institute of Science and Technology, Benxi, China;Graduate School of Engineering, University of Fukui, Fukui-shi, Japan;Graduate School of Engineering, University of Fukui, Fukui-shi, Japan
Venue:
ICIC'11 Proceedings of the 7th international conference on Intelligent Computing: bio-inspired computing and applications
Year:
2011

Citing 3
Cited 0

Optimization by simulated annealing: an experimental evaluation. Part I, graph partitioning

Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Hopfield network learning method for bipartite subgraph problem

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a saturation binary neuron model and use it to construct a Hopfield-type neural network called saturation binary neural network to solve the bipartite sub-graph problem. A large number of instances have been simulated to verify the proposed algorithm, with the simulation result showing that our algorithm finds the solution quality is superior to the compared algorithms.