Skip to content

Branch-and-Cut for an SDP Relaxation of Large-Scale Minimum Bisection Problems

Spend $50 to get a free movie!

ISBN-10: 3836486903

ISBN-13: 9783836486903

Edition: N/A

Authors: Michael Armbruster

List price: $11.00
Blue ribbon 30 day, 100% satisfaction guarantee!
Out of stock
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!


The minimum bisection problem (MB) is a challenging graph partitioning problem with numerous applications. Several inexact solution approaches for MB showed up in recent years. For the exact solution of large instances of MB, linear programming (LP) based methods were dominating. This doctoral thesis deals with the exact solution of large-scale MB via a semidefinite programming (SDP) relaxation in a branch-and-cut framework. After reviewing known results on the underlying bisection cut polytope, new valid inequalities are studied. Strengthenings based on the new cluster weight polytope and polynomial separation algorithms for special cases are investigated. Computationally, the dual of the…    
Customers also bought

Book details

List price: $11.00
Publisher: AV Akademikerverlag GmbH & Co. KG
Binding: Paperback
Pages: 240
Size: 6.00" wide x 9.00" long x 0.51" tall
Weight: 0.792