Semidefinite bounds for the stability number of a graph via sums of squares of polynomials

2007-06-01

Mathematical Programming , Volume 110 - Issue 1 p. 145- 173

Additional Metadata
Keywords	Stability number of a graph - Semidefinite programming - Sum of squares of polynomials
MSC	Dominating sets, independent sets, cliques (msc 05C69), Semidefinite programming (msc 90C22), Combinatorial optimization (msc 90C27)
THEME	Logistics (theme 3)
Publisher	Springer
Journal	Mathematical Programming
Project	Semidefinite programming and combinatorial optimization
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	Gvozdenovic, N., & Laurent, M. (2007). Semidefinite bounds for the stability number of a graph via sums of squares of polynomials. Mathematical Programming, 110(1), 145–173.

Additional Files
Fulltext Final Version

Publication