Semidefinite programming approximations for stable sets, colouring, and cuts in graphs

2009

Presented at the Theoriedag van de Nederlandse Vereniging voor Theoretische Informatica, Utrecht

639.032.203

Additional Metadata
Keywords	semidefinite programming, polynomial optimization, combinatorial optimization, sums of squares
THEME	Logistics (theme 3)
Publisher	CWI
Editor	J. Lammerink , J.P. Katoen , J.N. Kok (Joost) , J.C. van de Pol (Jaco) , F. van Raamsdonk (Femke)
Journal	Nieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica
Project	Semidefinite programming and combinatorial optimization
Conference	Theoriedag van de Nederlandse Vereniging voor Theoretische Informatica
Organisation	Networks and Optimization
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Laurent, M. (2009). Semidefinite programming approximations for stable sets, colouring, and cuts in graphs. Nieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica, 49–60.

Additional Files
Publisher Version

Publication