On the Graph Bisection Cut Polytope

DOI10.1137/060675253zbMath1194.90120OpenAlexW1963963496MaRDI QIDQ3394988

Michael Armbruster, Marzena Fügenschuh, Alexander Martin, Christoph Helmberg

Publication date: 20 August 2009

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/060675253

zbMATH Keywords

graph partitioningvalid inequalitiesinteger polyhedra

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

An overview of graph covering and partitioning, LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison, On the polyhedral structure of uniform cut polytopes, A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem, Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes, From equipartition to uniform cut polytopes: extended polyhedral results, SCIP: solving constraint integer programs