Photo of Monique Laurent
  • Warandelaan 2, Prisma Building, room P 2.221

    5037 AB Tilburg

    Netherlands

1986 …2018
If you made any changes in Pure these will be visible here soon.

Personal profile

Research interests

My field of expertise is combinatorial optimization. In the recent years I am in particular interested in the use of semidefinite programming to design efficient approximations for hard combinatorial problems (graph coloring, max-cut, etc.) and, more generally, for polynomial optimization problems, where objective and constraints are polynomial functions and algorithms can be developed using algebraic techniques.

For further information, please refer to my webpage at CWI

Career

1985 to 1986: Guest researcher at New York University

1986 to 1988: Research engineer at CNET (Centre National d'Etudes des Telecommunications, Paris, France)

1988 to 1997: Researcher at CNRS (Paris, France), with affiliation with Universite Paris Dauphine between 1988-1992 and at Ecole Normale Superieure  between 1992-1997

August 1990 to February 1992:   Research fellow of the Von Humboldt Foundation at the Institute of Discrete Mathematics and Operations Research in Bonn, Germany

From 1997: Researcher at Centrum Wiskunde & Informatica (CWI), Amsterdam

From 2005: Leader of the research group Algorithms, Combinatorics and Optimization at CWI

From September 2009: Part-time full professor at the Department of Econometrics and Operations Research, Tilburg School of Economics and Management

External positions

(Centrum Wiskunde & Informatica (CWI))

1 Sep 1997 → …

Keywords

  • Operations Research
  • Optimisation
  • Combinatorics
  • Mathematics

Fingerprint Dive into the research topics where Monique Laurent is active. These topic labels come from the works of this person. Together they form a unique fingerprint.

  • 5 Similar Profiles
Polynomial Mathematics
Optimization Mathematics
Positive semidefinite Mathematics
Hypercube Mathematics
Positive Semidefinite Matrix Mathematics
Symmetric matrix Mathematics
Upper bound Mathematics
Quantum Graphs Mathematics

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 1986 2018

Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization

Gribling, S., de Laat, D. & Laurent, M., Jul 2018, In : Mathematical Programming . 170, 1, p. 5-42

Research output: Contribution to journalArticleScientificpeer-review

Open Access
Quantum Graphs
Entanglement
Polynomials
Polynomial
Optimization
76 Downloads (Pure)

Comparison of Lasserre's measure-based bounds for polynomial optimization to bounds obtained by simulated annealing

de Klerk, E. & Laurent, M., Nov 2018, In : Mathematics of Operations Research. 43, 4, p. 1317-1325

Research output: Contribution to journalArticleScientificpeer-review

File
Simulated annealing
Simulated Annealing
Polynomials
Polynomial
Optimization

Worst-case examples for Lasserre's measure-based hierarchy for polynomial optimization on the hypercube

de Klerk, E. & Laurent, M., 2018, (Accepted/In press) In : Mathematics of Operations Research.

Research output: Contribution to journalArticleScientificpeer-review

Open Access
File
Hypercube
Polynomials
Polynomial
Optimization
Convergence Rate

A Lex-BFS-based recognition algorithm for Robinsonian matrices

Laurent, M. & Seminaroti, M., May 2017, In : Discrete Applied Mathematics. 222, p. 151-165

Research output: Contribution to journalArticleScientificpeer-review

Breadth-first Search
Recognition Algorithm
Seriation
Interval Graphs
Divide and conquer

A structural characterization for certifying robinsonian matrices

Laurent, M., Seminaroti, M. & Tanigawa, S., 5 May 2017, In : The Electronic Journal of Combinatorics: EJC. 24, 2, p. 1-22 22 p., P2.21.

Research output: Contribution to journalArticleScientificpeer-review

Open Access
File
Interval Graphs
Unit
Adjacency Matrix
Weighted Graph
Substructure