Solving Graph Partitioning Problems with Parallel Metaheuristics
From MaRDI portal
Publication:4609771
DOI10.1007/978-3-319-59861-1_6zbMath1384.90114OpenAlexW2635623601MaRDI QIDQ4609771
Marcin Bała, Zbigniew Kokosiński
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
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum partition of an independence system into independent sets
- Some results concerning the complexity of restricted colorings of graphs
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
- Noising methods for a clique partitioning problem
- A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems
- An Introduction to Metaheuristic Techniques
- An Efficient Heuristic Procedure for Partitioning Graphs
- Graph Colorings