Solving the maxcut problem by the global equilibrium search
Solving the maxcut problem by the global equilibrium search
复制标题
DOI：
10.1007/s10559-010-9256-4
复制
发表时间：
2010-09
影响因子：
0.5
通讯作者：
V. Shylo;O. Shylo
中科院分区：
文献类型：
--
作者：
V. Shylo;O. Shylo
作者提出了一种求解maxcut问题的方法。它基于全局均衡搜索法，这是目前最有效的离散规划方法之一。分析了该算法的有效性。
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.