Application of parallel and hybrid metaheuristics for graph partitioning problem

DOI10.1007/978-3-030-10692-8_14OpenAlexW2910950380MaRDI QIDQ2420031

Marcin Pijanowski, Zbigniew Kokosiński

Publication date: 5 June 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-10692-8_14

zbMATH Keywords

graph partitioninghybrid metaheuristicsapproximate algorithmsparallel metaheuristicscircuit partitioningDIMACS graphsR-MAT graphs

Mathematics Subject Classification ID

Numerical analysis (65-XX)

This page was built for publication: Application of parallel and hybrid metaheuristics for graph partitioning problem