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

Full description

Bibliographic Details

Published in:	Neurocomputing (Amsterdam) Vol. 458; pp. 428 - 439
Main Authors:	Jiang, Shicong, Dang, Chuangyin
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 11.10.2021
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!