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
来源：
Cybernetics and Systems Analysis | 2010年 / 46卷 / 05期
关键词：
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 条
  • [1] Solving weighted max-cut problem by global equilibrium search
    Shylo, V.P.
    Shylo, O.V.
    Roschyn, V.A.
    Cybernetics and Systems Analysis, 2012, 48 (04) : 563 - 567
  • [2] Solving unconstrained binary quadratic programming problem by global equilibrium search
    Shylo V.P.
    Shylo O.V.
    Cybernetics and Systems Analysis, 2011, 47 (6) : 889 - 897
  • [3] Teams of Global Equilibrium Search Algorithms for Solving the Weighted Maximum Cut Problem in Parallel
    Shylo V.P.
    Glover F.
    Sergienko I.V.
    Cybernetics and Systems Analysis, 2015, 51 (01) : 16 - 24
  • [4] Solving weighted MAX-SAT via global equilibrium search
    Shylo, Oleg V.
    Prokopyev, Oleg A.
    Shylo, Vladimir R.
    OPERATIONS RESEARCH LETTERS, 2008, 36 (04) : 434 - 438
  • [5] An Advanced Crow Search Algorithm for Solving Global Optimization Problem
    Lee, Donwoo
    Kim, Jeonghyun
    Shon, Sudeok
    Lee, Seungjae
    APPLIED SCIENCES-BASEL, 2023, 13 (11):
  • [6] Near-term quantum algorithm for solving the MaxCut problem with fewer resources
    Zhao, Xiumei
    Li, Yongmei
    Li, Jing
    Wang, Shasha
    Wang, Song
    Qin, Sujuan
    Gao, Fei
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2024, 648
  • [7] Stochastic Neuromorphic Circuits for Solving MAXCUT
    Theilman, Bradley H.
    Wang, Yipu
    Parekht, Ojas
    Severa, William
    Smith, J. Darby
    Aimone, James B.
    2023 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM, IPDPS, 2023, : 779 - 787
  • [8] An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem
    Luigi Grippo
    Laura Palagi
    Veronica Piccialli
    Mathematical Programming, 2011, 126 : 119 - 146
  • [9] Global equilibrium search applied to the unconstrained binary quadratic optimization problem
    Pardalos, Panos M.
    Prokopyev, Oleg A.
    Shylo, Oleg V.
    Shylo, Vladimir P.
    OPTIMIZATION METHODS & SOFTWARE, 2008, 23 (01): : 129 - 140
  • [10] An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem
    Grippo, Luigi
    Palagi, Laura
    Piccialli, Veronica
    MATHEMATICAL PROGRAMMING, 2011, 126 (01) : 119 - 146
12345