Genetic local search the graph partitioning problem under cardinality constraints
From MaRDI portal
Publication:2901171
DOI10.1134/S096554251201006XzbMath1249.05306OpenAlexW2057379294MaRDI QIDQ2901171
Yury A. Kochetov, Aleksandr V. Plyasunov
Publication date: 16 July 2012
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s096554251201006x
Programming involving graphs or networks (90C35) Searching and sorting (68P10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
A bilevel planning model for public-private partnership ⋮ Comparison of metaheuristics for the bilevel facility location and mill pricing problem ⋮ Genetic local search and hardness of approximation for the server load balancing problem ⋮ Hitting times of local and global optima in genetic algorithms with very high selection pressure
This page was built for publication: Genetic local search the graph partitioning problem under cardinality constraints
