Project code: SPCO
Research group: Algorithms, Combinatorics and Optimization (PNA1)

Coordinator of this project: Monique Laurent

Research in this project focuses on the interplay between semidefinite programming and combinatorial optimization. One of the main objectives is the design of strong and efficient approximations to hard problems, such as combinatorial optimization problems and integer and polynomial programming problems (i.e., minimizing a polynomial function over a real semi-algebraic set defined by polynomial equations and inequalities). The methods use combinatorial, geometric, and algebraic tools; e.g., from real algebraic geometry about positive polynomials and sums of squares of polynomials and the dual theory of moments, representation and invariant theory for exploiting symmetry, etc.

Members

 Marianna Eisenberg-Nagy,  Frank Vallentin,  Antonios Varvitsiotis

Previous members

• Betrtrand Meyer (01-01-2009 till 11-04-2009)
• Nebojsa Gvozdenovic (01-03-2004 till 31/01/2008)
• Hayato Waki  (15/06/2007 till 31/03/2008)
• Hein van der Holst (15-04-2004 till 31-07-2004)
• Dorina Jibetean (01-10-2003 till 30-04-2004)