Multilevel iterated tabu search for the multi-constraint graph partitioning problem
From MaRDI portal
Cites work
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- An effective multi-level memetic search with neighborhood reduction for the clustered team orienteering problem
- An Efficient Heuristic Procedure for Partitioning Graphs
- An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment
- An exact approach for the multi-constraint graph partitioning problem
- Engineering multilevel graph partitioning algorithms
- scientific article; zbMATH DE number 1304274 (Why is no real title available?)
- Iterated multilevel simulated annealing for large-scale graph conductance minimization
- Linear and quadratic programming approaches for the general graph partitioning problem
- Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices
- Multilevel refinement for combinatorial optimisation problems
- Parallel static and dynamic multi‐constraint graph partitioning
- Partitioning Sparse Matrices for Parallel Preconditioned Iterative Methods
- Size-constrained graph partitioning polytopes
- The case for strategic oscillation
- The Optimal Partitioning of Graphs
- The partition problem
- Tree-based coarsening and partitioning of complex networks
- Two-phase GRASP for the multi-constraint graph partitioning problem
This page was built for publication: Multilevel iterated tabu search for the multi-constraint graph partitioning problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7237875)
