Approximation and Intractability Results for the Maximum Cut Problem and Its Variants
IEEE Transactions on Computers
Ejection chains, reference structures and alternating path methods for traveling salesman problems
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Design and performance of parallel and distributed approximation algorithms for Maxcut
Journal of Parallel and Distributed Computing
Tabu Search
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
Grasp and Path Relinking for 2-Layer Straight Line Crossing Minimization
INFORMS Journal on Computing
Scatter Search: Methodology and Implementations in C
Scatter Search: Methodology and Implementations in C
A Semidefinite Programming Based Polyhedral Cut and Price Approach for the Maxcut Problem
Computational Optimization and Applications
Competitive simulated annealing and Tabu Search algorithms for the max-cut problem
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Black box scatter search for general classes of binary optimization problems
Computers and Operations Research
Mutation Hopfield neural network and its applications
Information Sciences: an International Journal
Solving the maxcut problem by the global equilibrium search
Cybernetics and Systems Analysis
Using landscape measures for the online tuning of heterogeneous distributed gas
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Expert Systems with Applications: An International Journal
A hybridization between memetic algorithm and semidefinite relaxation for the max-cut problem
Proceedings of the 14th annual conference on Genetic and evolutionary computation
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
Variable neighborhood search with ejection chains for the antibandwidth problem
Journal of Heuristics
A Hopfield neural network applied to the fuzzy maximum cut problem under credibility measure
Information Sciences: an International Journal
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
Max-k-Cut by the Discrete Dynamic Convexized Method
INFORMS Journal on Computing
Solving large scale Max Cut problems via tabu search
Journal of Heuristics
Probabilistic GRASP-Tabu Search algorithms for the UBQP problem
Computers and Operations Research
| Hi-index | 0.00 |
The max-cut problem consists of finding a partition of the nodes of a weighted graph into two subsets such that the sum of the weights on the arcs connecting the two subsets is maximized. This is an NP-hard problem that can also be formulated as an integer quadratic program. Several solution methods have been developed since the 1970s and applied to a variety of fields, particularly in engineering and layout design. We propose a heuristic method based on the scatter-search methodology for finding approximate solutions to this optimization problem. Our solution procedure incorporates some innovative features within the scatter-search framework: (1) the solution of the maximum diversity problem to increase diversity in the reference set, (2) a dynamic adjustment of a key parameter within the search, and (3) the adaptive selection of a combination method. We perform extensive computational experiments to first study the effect of changes in critical scatter-search elements and then to compare the efficiency of our proposal with previous solution procedures.