Connections between semidefinite relaxations of the max-cut and stable set problems

M. Laurent, S. Poljak, F. Rendl

Research output: Contribution to journalArticleProfessional

14 Downloads (Pure)
Original languageEnglish
Pages (from-to)225-246
JournalMathematical Programming
Volume77
Issue number2
Publication statusPublished - 1997
Externally publishedYes

Cite this

@article{769111a737cf4a00b40d165edda47a7a,
title = "Connections between semidefinite relaxations of the max-cut and stable set problems",
author = "M. Laurent and S. Poljak and F. Rendl",
year = "1997",
language = "English",
volume = "77",
pages = "225--246",
journal = "Mathematical Programming",
issn = "0025-5610",
publisher = "Springer",
number = "2",

}

Connections between semidefinite relaxations of the max-cut and stable set problems. / Laurent, M.; Poljak, S.; Rendl, F.

In: Mathematical Programming, Vol. 77, No. 2, 1997, p. 225-246.

Research output: Contribution to journalArticleProfessional

TY - JOUR

T1 - Connections between semidefinite relaxations of the max-cut and stable set problems

AU - Laurent, M.

AU - Poljak, S.

AU - Rendl, F.

PY - 1997

Y1 - 1997

M3 - Article

VL - 77

SP - 225

EP - 246

JO - Mathematical Programming

JF - Mathematical Programming

SN - 0025-5610

IS - 2

ER -