A New Lagrangian Net Algorithm for Solving Max-Bisection Problems
Release Time:2025-04-30
Hits:
- Date:
- 2025-04-30
- Title of Paper:
- A New Lagrangian Net Algorithm for Solving Max-Bisection Problems
- Journal:
- Journal of Computational and Applied Mathematics
- Summary:
- 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.
- Co-author:
- Xu Fengmin, Chen Baili, Yuan Xian
- Volume:
- Vol, 225
- Page Number:
- pp.3718-3723
- Translation or Not:
- No
- Date of Publication:
- 2011-01-04