scientific article; zbMATH DE number 5117494

MaRDI QIDQ3416563zbMATH OpenFDO

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

Publication date 22 January 2007

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• Hybrid genetic algorithm within branch-and-cut for the minimum graph bisection problem
• A genetic algorithm for graph bisection
• LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
• scientific article; zbMATH DE number 907942
• A genetic algorithm for graph partitioning
• Genetic local search for the graph partitioning problem under cardinality constraints
• Single- and multi-objective evolutionary algorithms for graph bisectioning
• Solving the multidimensional maximum bisection problem by a genetic algorithm and variable neighborhood search
• Solving the maximally balanced connected partition problem in graphs by using genetic algorithm

Cited in

(8)

• Hybrid genetic algorithm within branch-and-cut for the minimum graph bisection problem
• Two new integer linear programming formulations for the vertex bisection problem
• An integer linear programming formulation and genetic algorithm for the maximum set splitting problem
• A semidefinite programming approach to the hypergraph minimum bisection problem
• scientific article; zbMATH DE number 666305 (Why is no real title available?)
• Single- and multi-objective evolutionary algorithms for graph bisectioning
• A genetic algorithm for graph bisection
• A note on edge-based graph partitioning and its linear algebraic structure

Describes a project that uses

Uses Software

• SCIP

This page was built for publication:

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