Skip to main content
University of Minnesota
back to search

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

Related Items

About This Item