Speeding up a memetic algorithm for the max-bisection problem

DOI10.3934/naco.2015.5.151zbMath1332.68207OpenAlexW2524161526MaRDI QIDQ2353470

Geng Lin, Yanpo Liu, Wen-Xing Zhu

Publication date: 14 July 2015

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/naco.2015.5.151

zbMATH Keywords

local searchmemetic algorithmcrossovermax-bisection

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

An effective iterated tabu search for the maximum bisection problem ⋮ Graph partitioning: an updated survey ⋮ A multiple search operator heuristic for the max-k-cut problem

Cites Work

• Memetic search for the max-bisection problem
• Solving the maxcut problem by the global equilibrium search
• A new Lagrangian net algorithm for solving max-bisection problems
• Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
• Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
• Conjugate conflict continuation graphs for multi-layer constrained via minimization
• A modified VNS metaheuristic for max-bisection problems
• Using domain decomposition to find graph bisectors
• A branch-and-cut algorithm for the equicut problem
• A note on approximating Max-Bisection on regular graphs
• A new approach to minimising the frontwidth in finite element calculations
• \(\text{MA}\mid\text{PM}\): memetic algorithms with population management
• A semidefinite programming based polyhedral cut and price approach for the maxcut problem
• Advanced Scatter Search for the Max-Cut Problem
• Some NP-complete problems in quadratic and nonlinear programming
• An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
• An Efficient Heuristic Procedure for Partitioning Graphs
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• A Gentle Introduction to Memetic Algorithms
• A Spectral Bundle Method for Semidefinite Programming
• A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
• A PROBE-Based Heuristic for Graph Partitioning
• An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
• An Efficient Memetic Algorithm for theMax-Bisection Problem
• Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
• Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
• Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection
• Evolutionary Computation in Combinatorial Optimization
• A .699-approximation algorithm for Max-Bisection.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Speeding up a memetic algorithm for the max-bisection problem