Solving the maxcut problem by the global equilibrium search

被引:12
|
作者
Shylo V.P. [1 ]
Shylo O.V. [2 ]
机构
[1] V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv
[2] University of Pittsburgh, Pittsburgh
关键词
algorithm efficiency; approximate methods; computational experiment; cutset; global equilibrium search;
D O I
10.1007/s10559-010-9256-4
中图分类号
学科分类号
摘要
The authors propose an approach to the solution of the maxcut problem. It is based on the global equilibrium search method, which is currently one of the most efficient discrete programming methods. The efficiency of the proposed algorithm is analyzed. © 2010 Springer Science+Business Media, Inc.
引用
收藏
页码:744 / 754
页数:10
相关论文
共 50 条