An efficient memetic algorithm for the graph partitioning problem

DOI10.1007/S10479-011-0983-3zbMATH Open1233.90271OpenAlexW1999993900MaRDI QIDQ763098FDOQ763098

P. Galinier, Zied Boujbel, Michael Coutinho Fernandes

Publication date: 9 March 2012

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-011-0983-3

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Efficient Heuristic Procedure for Partitioning Graphs
• Tabu Search—Part I
• A combined evolutionary search and multilevel optimisation approach to graph-partitioning
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
• Hybrid evolutionary algorithms for graph coloring
• Using tabu search techniques for graph coloring
• Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
• Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
• Integer Programming and Combinatorial Optimization
• Multilevel refinement for combinatorial optimisation problems
• Genetic algorithm for graph coloring: exploration of Galinier and Hao's algorithm

Cited In (19)

• A heuristic method for solving the problem of partitioning graphs with supply and demand
• A fast tri-individual memetic search approach for the distance-based critical node problem
• Heuristic search to the capacitated clustering problem
• A three-phased local search approach for the clique partitioning problem
• Reinforcement learning based tabu search for the minimum load coloring problem
• An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks
• Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem
• Memetic search for the max-bisection problem
• Tabu search for the cyclic bandwidth problem
• Tabu search guided by reinforcement learning for the max-mean dispersion problem
• Local search for constrained graph clustering in biological networks
• Neighborhood decomposition-driven variable neighborhood search for capacitated clustering
• A tabu search based memetic algorithm for the Max-Mean dispersion problem
• Title not available (Why is that?)
• A hybrid metaheuristic of integrating estimation of distribution algorithm with Tabu search for the max-mean dispersion problem
• Moving clusters within a memetic algorithm for graph partitioning
• A hybrid metaheuristic method for the maximum diversity problem
• ILP-Based Local Search for Graph Partitioning
• A variable neighborhood search approach for the vertex bisection problem

Uses Software

• Bubble-FOS/C
• DibaP

Recommendations

• A combined evolutionary search and multilevel optimisation approach to graph-partitioning 👍 👎
• A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem 👍 👎
• A memetic algorithm for the max-cut problem 👍 👎
• An Efficient Memetic Algorithm for theMax-Bisection Problem 👍 👎
• Performance of a genetic algorithm for the graph partitioning problem 👍 👎
• Moving clusters within a memetic algorithm for graph partitioning 👍 👎
• A genetic algorithm for graph partitioning 👍 👎
• Artificial Evolution 👍 👎

This page was built for publication: An efficient memetic algorithm for the graph partitioning problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763098)