Full name: Monique Laurent
Formal name: Prof.dr. M. Laurent
Function: Group leader, Scientific Staff Member

Email: M.Laurent@cwi.nl
Telephone +31(0)20 592 4105
Room:  M238
Homepage:  http://www.cwi.nl/~monique
Research groups:
(PNA1) Algorithms Combinatorics and Optimization

Research

Monique Laurent does research in combinatorial optimization. Beside journal articles she published one book and several extensive expository articles. In the recent years she is in particular interested in the use of semidefinite programming and algebraic techniques to design efficient approximations for hard combinatorial problems and, more generally, for polynomial optimization problems, where objective and constraints are polynomial functions.

Career

2013 -	Onderzoeker E PNA1 - Algorithms, Combinatorics and Optimization
2009 -	Full professor at Tilburg University
2005 - 2012	Group leader PNA1 - Algorithms, Combinatorics and Optimization
1997 - 2005	Scientific staff member PNA1 - Algorithms, Combinatorics and Optimization
1988 - 1997	CNRS researcher (at Ecole Normale Supérieure, Paris, from 1992)

Selected Awards and Honours

2003	Vidi Innovational Research Grant NWO

Selected Academic Activities

2012 -	Member editorial board Journal: Mathematical Programming Series A
2011	Co-organizer Oberwolfach, Germany - Oberwolfach Workshop on Combinatorial Optimization
2010	Member organizing committee University of California - [UCLA] - IPAM; Trimester program on Modern Trends in Optimization and Its Application
2010	Co-organizer Oberwolfach, Germany - Oberwolfach Seminar on Semidefinite Optimization: Theory, Algorithms and Applications
2009	Co-organizer Oberwolfach, Germany - Oberwolfach Seminar on New Trends in Algorithms for Real Algebraic Geometry
2007 -	Associate editor Journal: SIAM Journal on Discrete Mathematics - [SIDMA]
2001 -	Associate editor Journal: SIAM Journal on Optimization - [SIOPT]
2001 -	Associate editor Journal: Mathematics of Operations Research

Selected Publications

M. Laurent, P. Rostalski. The approach of moments for polynomial equations. Handbook on Semidefinite, Conic and Polynomial Optimization, International Series in Operations Research and Management Science 166, 25–60, 2012.

J. Gouveia, M. Laurent, P. Parrilo, R. Thomas. A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs. Mathematical Programming 112, 203–225, 2012.

M. Laurent, E. de Klerk. On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems. SIAM Journal on Optimization 21, 824–832, 2011.

M. Laurent, A. Varvitsiotis. Computing the Grothendieck constant of some graph classes. Operations Research Letters 39, 452–456, 2011.

M. Laurent. Sums of squares, moment matrices and optimization over polynomials. Emerging Applications of Algebraic Geometry, The IMA Volumes in Mathematics and its Applications 149, 157–270, 2009.

J.B. Lasserre, M. Laurent, P. Rostalski. Semidefinite characterization and computation of zero-dimensional real radical ideals. Foundations of Computational Mathematics 8, 607–647, 2008.

N. Gvozdenovic, M. Laurent. Semidefinite bounds for the stability number of a graph via sums of squares of polynomials. Mathematical Programming 110, 145–173, 2007.

M. Laurent. Strengthened semidefinite programming bounds for codes. Mathematical Programming 109, 239–261, 2007.

E. de Klerk, M. Laurent, P. Parrilo. A PTAS for the minimization of polynomials of fixed degree over the simplex. Theoretical Computer Science 361, 210–225, 2006.

All publications (link to repository)