.png){kind=icon}
返回
An approximation algorithm for graph partitioning via deterministic annealing neural network
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neunet.2019.05.010.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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 continuation method that attempts to obtain a high-quality solution by following a path of minimum points of a barrier problem as the barrier parameter is reduced from a sufficiently large positive number to 0. With the barrier parameter assumed to be any positive number, one minimum solution of the barrier problem can be found by the algorithm in a feasible descent direction. With a globally convergent iterative procedure, the feasible descent direction could be obtained by renewing Lagrange multipliers red. A distinctive feature of it is that the upper and lower bounds on the variables will be automatically satisfied on the condition that the step length is a value from 0 to 1. Four wellknown algorithms are compared with the proposed one on 100 test samples. Simulation results show effectiveness of the proposed algorithm. (C) 2019 Elsevier Ltd. All rights reserved.
Keyword:
Graph partitioning
Neural network
Combinatorial optimization
NP-hard problem
Deterministic annealing neural network algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
8.2K
被引数:
3.0W
机构
引用论文
A deterministic annealing algorithm for approximating a solution of the min-bisection problem.png)
NEURAL NETWORKS
NEURAL NETWORKSIF6.3
PREAI
分享收藏A deterministic annealing algorithm for the minimum concave cost network flow problemNEURAL NETWORKS
NEURAL NETWORKSIF6.3
PREAI
分享收藏A systematic study of the class imbalance problem in convolutional neural networks卷积神经网络中类不平衡问题的系统研究NEURAL NETWORKS
OAAI
NEURAL NETWORKSIF6.3
OAAI分享收藏A globally convergent Lagrange and barrier function iterative algorithm for the traveling salesman problemNEURAL NETWORKS
NEURAL NETWORKSIF6.3
PREAI
分享收藏
查看更多内容