An approximation algorithm for graph partitioning via deterministic annealing neural network.

Wu, Zhengtian; Karimi, Hamid Reza; Dang, Chuangyin

Wu, Zhengtian; Karimi, Hamid Reza; Dang, Chuangyin.

Afiliación

Wu Z; School of Electronic and Information Engineering, Suzhou University of Science and Technology, Suzhou, China; Department of Mechanical Engineering, Politecnico di Milano, Milan, Italy. Electronic address: wzht8@mail.usts.edu.cn.
Karimi HR; Department of Mechanical Engineering, Politecnico di Milano, Milan, Italy. Electronic address: hamidreza.karimi@polimi.it.
Dang C; Department of Systems Engineering and Engineering Management, City University of Hong Kong, Hong Kong.

Neural Netw ; 117: 191-200, 2019 Sep.

Article en En | MEDLINE | ID: mdl-31174047

Asunto(s)

Redes Neurales de la Computación

Palabras clave

Combinatorial optimization; Deterministic annealing neural network algorithm; Graph partitioning; NP-hard problem; Neural network

Texto completo

Añadir a Mi BVS

Imprimir

XML

PubMed Links

Buscar en Google

Texto completo: 1 Colección: 01-internacional Base de datos: MEDLINE Asunto principal: Redes Neurales de la Computación Tipo de estudio: Prognostic_studies Idioma: En Revista: Neural Netw Asunto de la revista: NEUROLOGIA Año: 2019 Tipo del documento: Article Pais de publicación: Estados Unidos

Texto completo

Añadir a Mi BVS

Imprimir

XML

PubMed Links

Buscar en Google