LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison

Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Alexander Martin. LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison. Math. Program. Comput., 4(3):275-306, 2012. [doi]

Abstract

Abstract is missing.