Graph bisection revisited
Sotirov,Renata
Sotirov,Renata
Abstract
The graph bisection problem is the problem of partitioning the vertex set of a graph into two sets of given sizes such that the sum of weights of edges joining these two sets is optimized. We present a semidefinite programming relaxation for the graph bisection problem with a matrix variable of order n—the number of vertices of the graph—that is equivalent to the currently strongest semidefinite programming relaxation obtained by using vector lifting. The reduction in the size of the matrix variable enables us to impose additional valid inequalities to the relaxation in order to further strengthen it. The numerical results confirm that our simplified and strengthened semidefinite relaxation provides the currently strongest bound for the graph bisection problem in reasonable time.
Description
Date
2018-06
Journal Title
Journal ISSN
Volume Title
Publisher
Research Projects
Organizational Units
Journal Issue
Keywords
graph bisection, graph partition, semidefinite programming, boolean quadratic polytope
Citation
Sotirov, R 2018, 'Graph bisection revisited', Annals of Operations Research, vol. 265, no. 1, pp. 143-154. https://doi.org/10.1007/s10479-017-2575-3