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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Expert systems with applications Jg. 38; H. 11; S. 13894 - 13905
Hauptverfasser:	Zhou, Ying, Wang, Jiahai, Yin, Jian
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Ltd 01.10.2011
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!