Multilevel k-way partitioning scheme for irregular graphs
Journal of Parallel and Distributed Computing
Handbook of Evolutionary Computation
Handbook of Evolutionary Computation
Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
SIAM Journal on Scientific Computing
Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
SIAM Journal on Optimization
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms
Proceedings of the 6th International Conference on Genetic Algorithms
Solving Graph Bisection Problems with Semidefinite Programming
INFORMS Journal on Computing
A Semidefinite Programming Based Polyhedral Cut and Price Approach for the Maxcut Problem
Computational Optimization and Applications
A modified VNS metaheuristic for max-bisection problems
Journal of Computational and Applied Mathematics
Advanced Scatter Search for the Max-Cut Problem
INFORMS Journal on Computing
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations
Mathematical Programming: Series A and B
Computers and Operations Research
An efficient algorithm for computing the distance between close partitions
Discrete Applied Mathematics
Solving the maxcut problem by the global equilibrium search
Cybernetics and Systems Analysis
A new Lagrangian net algorithm for solving max-bisection problems
Journal of Computational and Applied Mathematics
Handbook of Memetic Algorithms
Handbook of Memetic Algorithms
Efficient Algorithms for Layer Assignment Problem
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A Multilevel Memetic Approach for Improving Graph k-Partitions
IEEE Transactions on Evolutionary Computation
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
| Hi-index | 0.01 |
Given an undirected graph G=(V,E) with weights on the edges, the max-bisection problem (MBP) is to find a partition of the vertex set V into two subsets V"1 and V"2 of equal cardinality such that the sum of the weights of the edges crossing V"1 and V"2 is maximized. Relaxing the equal cardinality, constraint leads to the max-cut problem (MCP). In this work, we present a memetic algorithm for MBP which integrates a grouping crossover operator and a tabu search optimization procedure. The proposed crossover operator preserves the largest common vertex groupings with respect to the parent solutions while controlling the distance between the offspring solution and its parents. Extensive experimental studies on 71 well-known G-set benchmark instances demonstrate that our memetic algorithm improves, in many cases, the current best known solutions for both MBP and MCP.