An approximation algorithm for graph partitioning via deterministic annealing neural network

Graph partitioning, a classical NP-hard combinatorial optimization problem, is widely applied to industrial or management problems. In this study, an approximated solution of the graph partitioning problem is obtained by using a deterministic annealing neural network algorithm. The algorithm is a co...

Full description

Bibliographic Details

Published in:	Neural networks Vol. 117; pp. 191 - 200
Main Authors:	Wu, Zhengtian, Karimi, Hamid Reza, Dang, Chuangyin
Format:	Journal Article
Language:	English
Published:	United States Elsevier Ltd 01.09.2019
Subjects:	Combinatorial optimization Deterministic annealing neural network algorithm Graph partitioning Neural network NP-hard problem Graph partitioning Deterministic annealing neural network algorithm NP-hard problem Neural network Combinatorial optimization
ISSN:	0893-6080, 1879-2782, 1879-2782
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!