Local metaheuristics and graph partitioning
From MaRDI portal
Publication:2912418
zbMATH Open1254.05148MaRDI QIDQ2912418FDOQ2912418
Authors: Charles Edmond Bichot 
Publication date: 14 September 2012
Recommendations
- Population-based metaheuristics, fusion-fission and graph partitioning optimization
- An experimental evaluation of local search heuristics for graph partitioning
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- scientific article; zbMATH DE number 7286677
- scientific article; zbMATH DE number 5761786
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (10)
- Population-based metaheuristics, fusion-fission and graph partitioning optimization
- Application of the ``descent with mutations metaheuristic to a clique partitioning problem
- Methods of local optimization for the problem of permutating bipartite graphs
- Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
- An experimental evaluation of local search heuristics for graph partitioning
- Genetic local search for the graph partitioning problem under cardinality constraints
- Title not available (Why is that?)
- ILP-Based Local Search for Graph Partitioning
- Application of parallel and hybrid metaheuristics for graph partitioning problem
- Political districting to minimize cut edges
This page was built for publication: Local metaheuristics and graph partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912418)
