Graph bisection revisited

Research output: Contribution to journalArticleScientificpeer-review

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.
Original languageEnglish
Pages (from-to)143-154
JournalAnnals of Operations Research
Volume265
Issue number1
DOIs
Publication statusPublished - Jun 2018

Fingerprint

Graph
Semidefinite programming
Valid inequalities
Partitioning

Keywords

  • graph bisection
  • graph partition
  • semidefinite programming
  • boolean quadratic polytope

Cite this

Sotirov, Renata. / Graph bisection revisited. In: Annals of Operations Research. 2018 ; Vol. 265, No. 1. pp. 143-154.
@article{ceb6c17626f149a5a9946af7ae453f03,
title = "Graph bisection revisited",
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.",
keywords = "graph bisection, graph partition, semidefinite programming, boolean quadratic polytope",
author = "Renata Sotirov",
year = "2018",
month = "6",
doi = "10.1007/s10479-017-2575-3",
language = "English",
volume = "265",
pages = "143--154",
journal = "Annals of Operations Research",
issn = "0254-5330",
publisher = "Springer",
number = "1",

}

Graph bisection revisited. / Sotirov, Renata.

In: Annals of Operations Research, Vol. 265, No. 1, 06.2018, p. 143-154.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - Graph bisection revisited

AU - Sotirov, Renata

PY - 2018/6

Y1 - 2018/6

N2 - 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.

AB - 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.

KW - graph bisection

KW - graph partition

KW - semidefinite programming

KW - boolean quadratic polytope

U2 - 10.1007/s10479-017-2575-3

DO - 10.1007/s10479-017-2575-3

M3 - Article

VL - 265

SP - 143

EP - 154

JO - Annals of Operations Research

JF - Annals of Operations Research

SN - 0254-5330

IS - 1

ER -