A more efficient deterministic annealing neural network algorithm for the max-bisection problem

•Transform the max-bisection problem to a linearly constrained optimization problem.•Propose a deterministic annealing neural network algorithm by introducing a barrier function in square-root form.•Prove the existence of the integral minimum solution of the max-bisection problem in theory and the p...

Celý popis

Podrobná bibliografia

Vydané v:	Neurocomputing (Amsterdam) Ročník 458; s. 428 - 439
Hlavní autori:	Jiang, Shicong, Dang, Chuangyin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 11.10.2021
Predmet:	Descent direction Deterministic annealing Max-bisection problem Neural network Square-root barrier function Max-bisection problem Neural network Deterministic annealing Square-root barrier function Descent direction
ISSN:	0925-2312, 1872-8286
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!