A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem.

Michael Armbruster Marzena Fügenschuh Christoph Helmberg Alexander Martin A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem. 112-124 2008 IPCO http://dx.doi.org/10.1007/978-3-540-68891-4_8 conf/ipco/2008 db/conf/ipco/ipco2008.html#ArmbrusterFHM08