A New Lagrangian Net Algorithm for Solving Max-Bisection Problems
发布时间：2025-04-30
点击次数：
- 发布时间：
- 2025-04-30
- 论文名称：
- A New Lagrangian Net Algorithm for Solving Max-Bisection Problems
- 发表刊物：
- Journal of Computational and Applied Mathematics
- 摘要：
- The Max-Bisection problem is NP-hard
combinatorial optimization problem. In this paper, a new
Lagrangian net algorithm is proposed to solve the Max-Bisection problems.
First, we relax the bisection constraints to the objective function
by introducing the penalty function method. Second, a bisection
solution is calculated by a discrete Hopfild neural network (DHNN).
The increasing penalty factor can help the DHNN to escape from the
local minimum and to get a satisfying bisection. The
convergence analysis of the proposed algorithm is also presented.
Finally, numerical results of large scale G-set problems show that
the proposed method can find a better optimal solutions.
- 合写作者：
- Xu Fengmin, Chen Baili, Yuan Xian
- 卷号：
- Vol, 225
- 页面范围：
- pp.3718-3723
- 是否译文：
- 否
- 发表时间：
- 2011-01-04