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

2005

Presented at the International Conference on Integer Programming and Combinatorial Optimization, Berlin

Additional Metadata
Keywords	stable set problem, sums of squares of polynomials, copositive programming, semidefinite programming
MSC	Semidefinite programming (msc 90C22), Polyhedral combinatorics, branch-and-bound, branch-and-cut (msc 90C57)
THEME	Logistics (theme 3)
Publisher	Springer
Editor	M. Juenger , V. Kaibel
Series	Lecture Notes in Computer Science
Project	Semidefinite programming and combinatorial optimization
Conference	International Conference on Integer 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. (2005). Semidefinite bounds for the stability number of a graph via sums of squares of polynomials. . In M. Juenger & V. Kaibel (Eds.), Lecture Notes in Computer Science. Springer.

Additional Files
Fulltext Final Version
Publisher Version

Publication