Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem

DOI10.1016/j.cor.2019.06.002zbMath1458.90614OpenAlexW2949418063MaRDI QIDQ2273653

Yanyan Li

Publication date: 25 September 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2019.06.002

zbMATH Keywords

metaheuristicsgraph partitioningneighborhood searchadaptive perturbationconductance minimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Neighborhood decomposition-driven variable neighborhood search for capacitated clustering ⋮ Iterated multilevel simulated annealing for large-scale graph conductance minimization

Uses Software

• SNAP
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Memetic search for the max-bisection problem
• Graph clustering
• An effective multilevel tabu search approach for balanced graph partitioning
• An efficient memetic algorithm for the graph partitioning problem
• Breakout local search for the quadratic assignment problem
• A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning
• Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• A Polynomial Time Algorithm for Rayleigh Ratio on Discrete Variables: Replacing Spectral Techniques for Expander Ratio, Normalized Cut, and Cheeger Constant
• Design and implementation of move-based heuristics for VLSI hypergraph partitioning
• Integer Programming and Combinatorial Optimization
• SOFSEM 2006: Theory and Practice of Computer Science
• Expander flows, geometric embeddings and graph partitioning

This page was built for publication: Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem