Semidefinite programming and combinatorial optimization July 2002 - December 2008
Collection
Collection
-
A comparison of the Sherali-Adams, Lov\'asz-Schrijver and Lasserre relaxations for 0-1 programming. Article
Mathematics of Operations Research, 28(3), 470-496.January 2003
-
Lower bound for the number of iterations in semidefinite relaxations for the cut polytope. Article
Mathematics of Operations Research, 28(4), 871-883.November 2003
-
Semidefinite approximations for global unconstrained polynomial optimization Article
SIAM Journal on Optimization, 16(2), 490-514.January 2005
-
Semidefinite bounds for the stability number of a graph via sums of squares of polynomials. In Proceedings
January 2005
-
Semidefinite Programming and Integer Programming. Book Chapter
January 2005 -
Revisiting two theorems of Curto and Fialkow on moment matrices. Article
Proceedings of the American Mathematical Society, 133(10), 2965-2976.March 2005
-
A generalization of Voronoi's reduction theory and its application Tech Report
M. Dutour Sikirić (Mathieu), A. Schuermann and F. Vallentin (Frank)
January 2006
-
August 2006