An Efficient Memetic Algorithm for theMax-Bisection Problem

DOI10.1109/TC.2013.7zbMath1364.90332MaRDI QIDQ5268160

Geng Lin, Wen-Xing Zhu

Publication date: 20 June 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (5)

An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks ⋮ 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 ⋮ Speeding up a memetic algorithm for the max-bisection problem

This page was built for publication: An Efficient Memetic Algorithm for theMax-Bisection Problem