.png){kind=icon}
.png){kind=icon}
Return
A more efficient deterministic annealing neural network algorithm for the max-bisection problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2021.06.050.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The max-bisection problem has extensive applications in network engineering, making it imperative to develop effective methods to solve this problem. However, the efficient computation on this problem remains challenging due to its NP-hard computational complexity. To address this question, in this paper, we transform the max-bisection problem to an artificial linearly constrained optimization problem and develop a modified deterministic annealing neural network algorithm by introducing a barrier function. The barrier parameter of this function acts as the temperature in the annealing process and decreases from a large positive number to zero. The initial value of the barrier parameter promises that the artificial problem is convex and can be easily solved at the beginning of the descending process. The solution to the original max-bisection problem is finally obtained through a descent algorithm, in which the bound limit of the solution is always satisfied as long as the iteration step length is less than one. We have proved the theoretical convergence of the proposed algorithm. Numerical results demonstrate that the proposed algorithm has several advantages over both the approximation algorithms and metaheuristic methods. (c) 2021 Elsevier B.V. All rights reserved.
Keywords:
Max-bisection problem
Deterministic annealing
Neural network
Square-root barrier function
Descent direction
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.