Solving graph partitioning problems with parallel metaheuristics

DOI10.1007/978-3-319-59861-1_6MaRDI QIDQ4609771zbMATH OpenOpenAlexFDO

Authors Zbigniew Kokosiński, Marcin Bała

Publication date 26 March 2018

Published in Recent Advances in Computational Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-59861-1_6

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An experimental evaluation of local search heuristics for graph partitioning
• Parallel Metaheuristics Applications
• scientific article; zbMATH DE number 177834
• \(D^{3}G^{2}A\): the dynamic distributed double guided genetic algorithm for the \(K\)-graph partitioning problem
• Artificial Evolution

Cites work

• A parallel, linear programming-based heuristic for large-scale set partitioning problems
• An Efficient Heuristic Procedure for Partitioning Graphs
• An Introduction to Metaheuristic Techniques
• Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
• Efficient graph coloring with parallel genetic algorithms
• Engineering graph clustering: models and experimental evaluation
• Graph Colorings
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1314991 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• Minimum partition of an independence system into independent sets
• Noising methods for a clique partitioning problem
• Some results concerning the complexity of restricted colorings of graphs

Cited in

(3)

• Application of parallel and hybrid metaheuristics for graph partitioning problem
• Application of the ``descent with mutations metaheuristic to a clique partitioning problem
• Artificial Evolution

Describes a project that uses

Uses Software

• DIMACS
• CoLoR

This page was built for publication: Solving graph partitioning problems with parallel metaheuristics

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