Solving graph bisection problems with semidefinite programming
Stefan E. Karisch, Franz Rendl, and Jens Clausen
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.
Technical Report DIKU-TR-97/9, Department of Computer Science,
University of Copenhagen, July 1997
Contact: [email protected]
![[PS]](../../InteriorPoint/gif/PS.gif)
![[IP PAGE]](../../InteriorPoint/gif/HOME.gif)
![[SEARCH AGAIN]](../../InteriorPoint/gif/SEARCH.gif)