A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations.

Franz Rendl Giovanni Rinaldi Angelika Wiegele A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations. 295-309 2007 conf/ipco/2007 IPCO http://dx.doi.org/10.1007/978-3-540-72792-7_23 db/conf/ipco/ipco2007.html#RendlRW07