Cooperative annealing Hopfield network for unconstrained binary quadratic programming problem

► This paper first proposes an annealing HNN (AHNN) that permits temporary energy ascent to help the HNN escape from local minima. ► From a cooperative perspective, a population of the AHNN processes are then simultaneously implemented and coupled by their acceptance probabilities. ► The proposed Co...

Full description

Saved in:

Bibliographic Details
Published in:	Expert systems with applications Vol. 38; no. 11; pp. 13894 - 13905
Main Authors:	Zhou, Ying, Wang, Jiahai, Yin, Jian
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.10.2011
Subjects:	Algorithms Annealing Annealing Hopfield neural network Combinatorial analysis Combinatorial optimization problem Computer simulation Cooperative search Maximum cut problem Minima Networks Neural networks Quadratic programming Unconstrained binary quadratic programming problem Annealing Hopfield neural network Maximum cut problem Cooperative search Unconstrained binary quadratic programming problem Combinatorial optimization problem
ISSN:	0957-4174, 1873-6793
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!