An effective multilevel tabu search approach for balanced graph partitioning

DOI10.1016/J.COR.2010.10.007zbMATH Open1205.90286OpenAlexW2112882545MaRDI QIDQ622162FDOQ622162

Authors: Una Benlic, Jin-Kao Hao 

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

Recommendations

• Tabu search for graph partitioning
• scientific article; zbMATH DE number 1961985
• Multilevel graph partitioning: an evolutionary approach
• An efficient memetic algorithm for the graph partitioning problem
• A combined evolutionary search and multilevel optimisation approach to graph-partitioning

zbMATH Keywords

balanced partitioningiterated tabu searchmultilevel approach

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Title not available (Why is that?)
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• An Efficient Heuristic Procedure for Partitioning Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recent directions in netlist partitioning: a survey
• A combined evolutionary search and multilevel optimisation approach to graph-partitioning
• Neighborhood portfolio approach for local search applied to timetabling problems
• Genetic algorithm and graph partitioning
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
• Multilevel refinement for combinatorial optimisation problems
• Tabu search for graph partitioning
• Partitioning of VLSI Circuits on Subcircuits with Minimal Number of Connections Using Evolutionary Algorithm
• Title not available (Why is that?)
• A PROBE-Based Heuristic for Graph Partitioning

Cited In (21)

• A multilevel tabu search algorithm for balanced partitioning of unstructured grids
• Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
• Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
• The main tools and test benches for graph partitioning
• Balanced graph partitioning based on mixed 0-1 linear programming and iteration vertex relocation algorithm
• A new method, the fusion fission, for the relaxed \(k\)-way graph partitioning problem, and comparisons with some multilevel algorithms
• An exact algorithm for min-max hyperstructure equipartition with a connected constraint
• Title not available (Why is that?)
• An Effective Refinement Algorithm Based on Swarm Intelligence for Graph Bipartitioning
• A combined evolutionary search and multilevel optimisation approach to graph-partitioning
• A discrete dynamic convexized method for VLSI circuit partitioning
• On evaluating graph partitioning algorithms for distributed agent based models on networks
• Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem
• Local search for constrained graph clustering in biological networks
• Enumerating graph partitions without too small connected components using zero-suppressed binary and ternary decision diagrams
• Tabu search for graph partitioning
• A reactive self-tuning scheme for multilevel graph partitioning
• ILP-Based Local Search for Graph Partitioning
• Multilevel graph partitioning: an evolutionary approach
• Metaheuristics for the minimum gap graph partitioning problem
• A variable neighborhood search approach for the vertex bisection problem

Uses Software

• METIS
• Bubble-FOS/C
• DibaP
• Tabu search
• Chaco

This page was built for publication: An effective multilevel tabu search approach for balanced graph partitioning

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