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

Celý popis

Podrobná bibliografia

Vydané v:	Neural networks Ročník 117; s. 191 - 200
Hlavní autori:	Wu, Zhengtian, Karimi, Hamid Reza, Dang, Chuangyin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	United States Elsevier Ltd 01.09.2019
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!