Mathematics – Optimization and Control
Scientific paper
2009-12-09
Mathematics
Optimization and Control
20 pages, submitted to Mathematical Programming
Scientific paper
An exact algorithm is presented for solving edge weighted graph partitioning problems. The algorithm is based on a branch and bound method applied to a continuous quadratic programming formulation of the problem. Lower bounds are obtained by decomposing the objective function into convex and concave parts and replacing the concave part by an affine underestimate. It is shown that the best affine underestimate can be expressed in terms of the center and the radius of the smallest sphere containing the feasible set. The concave term is obtained either by a constant diagonal shift associated with the smallest eigenvalue of the objective function Hessian, or by a diagonal shift obtained by solving a semidefinite programming problem. Numerical results show that the proposed algorithm is competitive with state-of-the-art graph partitioning codes.
Hager William
Phan Dzung
Zhang Hongchao
No associations
LandOfFree
An exact algorithm for graph partitioning does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An exact algorithm for graph partitioning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An exact algorithm for graph partitioning will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-275657