Solving the maxcut problem by the global equilibrium search

Authors:
V. P. Shylo;O. V. Shylo
Affiliations:
V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine;University of Pittsburgh, Pittsburgh, USA
Venue:
Cybernetics and Systems Analysis
Year:
2010

Citing 8
Cited 5

An application of combinatorial optimization to statistical physics and circuit layout design

Operations Research
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs

SIAM Journal on Optimization
A Spectral Bundle Method for Semidefinite Programming

SIAM Journal on Optimization
Problems of discrete optimization: Challenges and main approaches to solve them

Cybernetics and Systems Analysis
Global equilibrium search applied to the unconstrained binary quadratic optimization problem

Optimization Methods & Software
Advanced Scatter Search for the Max-Cut Problem

INFORMS Journal on Computing
Solving weighted MAX-SAT via global equilibrium search

Operations Research Letters

Memetic search for the max-bisection problem

Computers and Operations Research
A memetic approach for the max-cut problem

PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
Path Relinking Scheme for the Max-Cut Problem within Global Equilibrium Search

International Journal of Swarm Intelligence Research
Breakout Local Search for the Max-Cutproblem

Engineering Applications of Artificial Intelligence
Probabilistic GRASP-Tabu Search algorithms for the UBQP problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.