An effective multilevel tabu search approach for balanced graph partitioning
From MaRDI portal
Publication:622162
DOI10.1016/j.cor.2010.10.007zbMath1205.90286OpenAlexW2112882545MaRDI QIDQ622162
Publication date: 31 January 2011
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.10.007
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
An exact algorithm for min-max hyperstructure equipartition with a connected constraint, Local search for constrained graph clustering in biological networks, A reactive self-tuning scheme for multilevel graph partitioning, Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking, Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem, Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm, A discrete dynamic convexized method for VLSI circuit partitioning
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multilevel refinement for combinatorial optimisation problems
- A combined evolutionary search and multilevel optimisation approach to graph-partitioning
- Tabu search for graph partitioning
- Neighborhood portfolio approach for local search applied to timetabling problems
- Recent directions in netlist partitioning: a survey
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Partitioning of VLSI Circuits on Subcircuits with Minimal Number of Connections Using Evolutionary Algorithm
- An Efficient Heuristic Procedure for Partitioning Graphs
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Genetic algorithm and graph partitioning
- Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
- A PROBE-Based Heuristic for Graph Partitioning
