Skip to main content

A comparative study of linear and semidefinite branch-and-cut methods for solving the minimum graph bisection problem

Related Items