.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Combinatorial optimization
Global optimization
Filled function
Max-cut
Continuation method
Local search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Bioinspired Asymmetric Surface Property of Functionalized Mesh to Maximize the Efficiency of Fog Harvesting.png)
ChemNanoMat
ChemNanoMatIF0
PREAI
分享收藏Application of FTIR Method to Monitor the Service Condition of Used Diesel Engine Lubricant Oil
PREAI
分享收藏
查看更多内容