Hybrid genetic algorithm within branch-and-cut for the minimum graph bisection problem
From MaRDI portal
Publication:1742597
DOI10.1007/11730095_1zbMath1401.90271OpenAlexW1761805795MaRDI QIDQ1742597
Michael Armbruster, Alexander Martin, Marzena Fügenschuh, Nikolay Jetchev, Christoph Helmberg
Publication date: 12 April 2018
Full work available at URL: https://doi.org/10.1007/11730095_1
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
