A combined evolutionary search and multilevel optimisation approach to graph-partitioning

DOI10.1023/B:JOGO.0000042115.44455.f3zbMath1084.90049OpenAlexW1989826169MaRDI QIDQ1888147

Mark Cross, Chris Walshaw, Alan J. Soper

Publication date: 22 November 2004

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:jogo.0000042115.44455.f3

zbMATH Keywords

genetic algorithmsgraph-partitioningEvolutionary searchmultilevel optimisation

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (20)

Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance ⋮ A deterministic annealing algorithm for approximating a solution of the min-bisection problem ⋮ Parallel mesh-partitioning algorithms for generating shape optimised partitions using evolutionary computing ⋮ Finding near-optimal independent sets at scale ⋮ Moving clusters within a memetic algorithm for graph partitioning ⋮ Graph Bisection with Pareto Optimization ⋮ ILP-Based Local Search for Graph Partitioning ⋮ Better Process Mapping and Sparse Quadratic Assignment ⋮ An effective multilevel tabu search approach for balanced graph partitioning ⋮ A reactive self-tuning scheme for multilevel graph partitioning ⋮ An exact algorithm for graph partitioning ⋮ A new method, the fusion fission, for the relaxed \(k\)-way graph partitioning problem, and comparisons with some multilevel algorithms ⋮ An efficient approach for large scale graph partitioning ⋮ Unique optimal solution instance and computational complexity of backbone in the graph bi-partitioning problem ⋮ An exact combinatorial algorithm for minimum graph bisection ⋮ Advanced Coarsening Schemes for Graph Partitioning ⋮ An efficient memetic algorithm for the graph partitioning problem ⋮ Unnamed Item ⋮ A discrete dynamic convexized method for VLSI circuit partitioning ⋮ Tree-Based Coarsening and Partitioning of Complex Networks

This page was built for publication: A combined evolutionary search and multilevel optimisation approach to graph-partitioning