.png){kind=icon}
.png){kind=icon}
Return
A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2008.07.026.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, a discrete filled function algorithm embedded with continuous approximation is proposed to Solve max-cut problems. A new discrete filled function is defined for max-cut problems, and properties of the function are studied. In the process of finding an approximation to the global solution of a max-cut problem, a continuation optimization algorithm is employed to find local solutions of a continuous relaxation of the max-cut problem, and then global searches are performed by minimizing the proposed filled function. Unlike general filled function methods, characteristics of max-cut problems are used. The parameters in the proposed filled function need not to be adjusted and are exactly the same for all max-cut problems that greatly increases the efficiency of the filled function method. Numerical results and comparisons on some well known max-cut test problems show that the proposed algorithm is efficient to get approximate global solutions of max-cut problems, (C) 2008 Elsevier B.V. All rights reserved.
Keywords:
Combinatorial optimization
Global optimization
Filled function
Max-cut
Continuation method
Local search
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W