C. C. de Souza;M. Laurent
-;-
A comparative study of linear and semidefinite branch-and-cut methods for solving the minimum graph bisection problem
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Facet-defining inequalities for the simple graph partitioning polytope
Discrete Optimization