A multilevel tabu search algorithm for balanced partitioning of unstructured grids
From MaRDI portal
Publication:6558894
DOI10.1002/NME.5003zbMATH Open1548.90508MaRDI QIDQ6558894
Seyed Saied Bahrainian, Zahra Mehrdoost
Publication date: 21 June 2024
Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Parallel numerical computation (65Y05) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- An effective multilevel tabu search approach for balanced graph partitioning
- A retrofit based methodology for the fast generation and optimization of large-scale mesh partitions: Beyond the minimum interface size criterion
- A combined evolutionary search and multilevel optimisation approach to graph-partitioning
- Tabu search for graph partitioning
- 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
- Least squares quantization in PCM
This page was built for publication: A multilevel tabu search algorithm for balanced partitioning of unstructured grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6558894)
