Hybrid genetic algorithm within branch-and-cut for the minimum graph bisection problem

DOI10.1007/11730095_1MaRDI QIDQ1742597zbMATH OpenOpenAlexFDO

Authors Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Nikolay Jetchev, Alexander Martin

Publication date 12 April 2018

Full work available at URL https://doi.org/10.1007/11730095_1

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 5117494
• A genetic algorithm for graph bisection
• scientific article; zbMATH DE number 5237020
• An exact combinatorial algorithm for minimum graph bisection
• Exact combinatorial branch-and-bound for graph bisection

Cited in

(4)

• scientific article; zbMATH DE number 5117494 (Why is no real title available?)
• Single- and multi-objective evolutionary algorithms for graph bisectioning
• A genetic algorithm for graph bisection
• Solving the minimum bisection problem using a biologically inspired computational model

This page was built for publication: Hybrid genetic algorithm within branch-and-cut for the minimum graph bisection problem

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