Iterated multilevel simulated annealing for large-scale graph conductance minimization
From MaRDI portal
Publication:6071282
DOI10.1016/j.ins.2021.04.102zbMath1524.90330MaRDI QIDQ6071282
Una Benlic, David Lesaint, Zhi Lu, Jin-Kao Hao
Publication date: 23 November 2023
Published in: Information Sciences (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A survey on optimization metaheuristics
- Multilevel refinement for combinatorial optimisation problems
- Compact structure for sparse undirected graphs based on a clique graph partition
- Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem
- TTT plots: a perl program to create time-to-target plots
- 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
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Graph Partitioning and Graph Clustering
- A Polynomial Time Algorithm for Rayleigh Ratio on Discrete Variables: Replacing Spectral Techniques for Expander Ratio, Normalized Cut, and Cheeger Constant
- Integer Programming and Combinatorial Optimization
- SOFSEM 2006: Theory and Practice of Computer Science
- Expander flows, geometric embeddings and graph partitioning
- Handbook of metaheuristics
This page was built for publication: Iterated multilevel simulated annealing for large-scale graph conductance minimization
