Path Relinking Scheme for the Max-Cut Problem within Global Equilibrium Search

Authors:
Volodymyr P. Shylo;Oleg V. Shylo
Affiliations:
Institute of Cybernetics NAS of Ukraine, Ukraine;University of Pittsburgh, USA
Venue:
International Journal of Swarm Intelligence Research
Year:
2011

Citing 8
Cited 0

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
On greedy construction heuristics for the MAX-CUT problem

International Journal of Computational Science and Engineering
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 the maxcut problem by the global equilibrium search

Cybernetics and Systems Analysis
Solving weighted MAX-SAT via global equilibrium search

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, the potential of the path relinking method for the maximum cut problem is investigated. This method is embedded within global equilibrium search to utilize the set of high quality solutions provided by the latter. The computational experiment on a set of standard benchmark problems is provided to study the proposed approach. The empirical experiments reveal that the large sizes of the elite set lead to restart distribution of the running times, i.e., the algorithm can be accelerated by simply removing all of the accumulated data set P and re-initiating its execution after a certain number of elite solutions is obtained.