Abstract
An exact solution method for the graph bisection problem is presented. We describe a branch-and-bound algorithm which is based on a cutting plane approach combining semidefinite programming and polyhedral relaxations. We report on extensive numerical experiments which were performed for various classes of graphs. The results indicate that the present approach solves general problem instances with 80–90 vertices exactly in reasonable time and provides tight approximations for larger instances. Our approach is particularly well suited for special classes of graphs as planar graphs and graphs based on grid structures.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
