Monique Laurent

ORCID

Publication Activity (10 Years)

Years Active: 1984-2024
Publications (10 Years): 32

Top Venues

Publications

Milan Korda, Monique Laurent, Victor Magron, Andries Steenkamp
Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks. Math. Program. 205 (1) (2024)
Monique Laurent, Luis Felipe Vargas
Exactness of Parrilo's Conic Approximations for Copositive Matrices and Associated Low Order Bounds for the Stability Number of a Graph. Math. Oper. Res. 48 (2) (2023)
Monique Laurent, Lucas Slot
An effective version of Schmüdgen's Positivstellensatz for the hypercube. Optim. Lett. 17 (3) (2023)
Lucas Slot, Monique Laurent
Sum-of-squares hierarchies for binary polynomial optimization. Math. Program. 197 (2) (2023)
Lucas Slot, Monique Laurent
Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets. Math. Program. 193 (2) (2022)
Monique Laurent, Luis Felipe Vargas
Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph. SIAM J. Optim. 32 (2) (2022)
Etienne de Klerk, Monique Laurent
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere. Math. Program. 193 (2) (2022)
Lucas Slot, Monique Laurent
Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization. Math. Program. 188 (2) (2021)
Lucas Slot, Monique Laurent
Sum-of-Squares Hierarchies for Binary Polynomial Optimization. IPCO (2021)
Monique Laurent, Shin-ichi Tanigawa
Perfect elimination orderings for symmetric matrices. Optim. Lett. 14 (2) (2020)
Etienne de Klerk, Monique Laurent
Worst-Case Examples for Lasserre's Measure-Based Hierarchy for Polynomial Optimization on the Hypercube. Math. Oper. Res. 45 (1) (2020)
Hao Hu, Monique Laurent
On the linear extension complexity of stable set polytopes for perfect graphs. Eur. J. Comb. 80 (2019)
Sander Gribling, David de Laat, Monique Laurent
Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization. Found. Comput. Math. 19 (5) (2019)
Etienne de Klerk, Monique Laurent
Comparison of Lasserre's Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing. Math. Oper. Res. 43 (4) (2018)
Sander Gribling, David de Laat, Monique Laurent
Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization. Math. Program. 170 (1) (2018)
Etienne de Klerk, Monique Laurent, Zhao Sun
Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization. Math. Program. 162 (1-2) (2017)
Monique Laurent, Matteo Seminaroti, Shin-ichi Tanigawa
A Structural Characterization for Certifying Robinsonian Matrices. Electron. J. Comb. 24 (2) (2017)
Monique Laurent, Matteo Seminaroti, Shin-ichi Tanigawa
A Structural Characterization for Certifying Robinsonian Matrices. CoRR (2017)
Etienne de Klerk, Monique Laurent, Zhao Sun, Juan C. Vera
On the convergence rate of grid search for polynomial optimization over the simplex. Optim. Lett. 11 (3) (2017)
Etienne de Klerk, Jean B. Lasserre, Monique Laurent, Zhao Sun
Bound-Constrained Polynomial Optimization Using Only Elementary Calculations. Math. Oper. Res. 42 (3) (2017)
Etienne de Klerk, Roxana Hess, Monique Laurent
Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization. SIAM J. Optim. 27 (1) (2017)
Monique Laurent, Matteo Seminaroti
Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition. SIAM J. Discret. Math. 31 (3) (2017)
Monique Laurent, Matteo Seminaroti
A Lex-BFS-based recognition algorithm for Robinsonian matrices. Discret. Appl. Math. 222 (2017)
Monique Laurent, Matteo Seminaroti
Similarity-First Search: a new algorithm with application to Robinsonian matrix recognition. CoRR (2016)
Monique Laurent, Teresa Piovesan
Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone. SIAM J. Optim. 25 (4) (2015)
Sabine Burgdorf, Monique Laurent, Teresa Piovesan
On the Closure of the Completely Positive Semidefinite Cone and Linear Approximations to Quantum Colorings. TQC (2015)
Etienne de Klerk, Monique Laurent, Zhao Sun
An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution. SIAM J. Optim. 25 (3) (2015)
Monique Laurent, Matteo Seminaroti
The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure. Oper. Res. Lett. 43 (1) (2015)
Jop Briët, Harry Buhrman, Monique Laurent, Teresa Piovesan, Giannicola Scarpa
Entanglement-Assisted Zero-Error Source-Channel Coding. IEEE Trans. Inf. Theory 61 (2) (2015)
Monique Laurent, Matteo Seminaroti
A Lex-BFS-based recognition algorithm for Robinsonian matrices. CoRR (2015)
Etienne de Klerk, Monique Laurent, Zhao Sun
An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex. Math. Program. 151 (2) (2015)
Monique Laurent, Matteo Seminaroti
A Lex-BFS-Based Recognition Algorithm for Robinsonian Matrices. CIAC (2015)
Monique Laurent, Matteo Seminaroti
The Quadratic Assignment Problem is easy for Robinsonian Matrices. CoRR (2014)
Monique Laurent, Zhao Sun
Handelman's hierarchy for the maximum stable set problem. J. Glob. Optim. 60 (3) (2014)
Monique Laurent, Antonios Varvitsiotis
A new graph parameter related to bounded rank positive semidefinite matrix completions. Math. Program. 145 (1-2) (2014)
Marianna Eisenberg-Nagy, Monique Laurent, Antonios Varvitsiotis
Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope. J. Comb. Theory, Ser. B 108 (2014)
Monique Laurent, Zhao Sun
Handelman's hierarchy for the maximum stable set problem. CTW (2013)
Jean-Bernard Lasserre, Monique Laurent, Bernard Mourrain, Philipp Rostalski, Philippe Trebuchet
Moment matrices, border bases and real radical computation. J. Symb. Comput. 51 (2013)
Marianna Eisenberg-Nagy, Monique Laurent, Antonios Varvitsiotis
On bounded rank positive semidefinite matrix completions of extreme partial correlation matrices CoRR (2012)
João Gouveia, Monique Laurent, Pablo A. Parrilo, Rekha R. Thomas
A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs. Math. Program. 133 (1-2) (2012)
Monique Laurent, Antonios Varvitsiotis
The Gram Dimension of a Graph. ISCO (2012)
Monique Laurent, Antonios Varvitsiotis
A new graph parameter related to bounded rank positive semidefinite matrix completions CoRR (2012)
Monique Laurent, Antonios Varvitsiotis
Computing the Grothendieck constant of some graph classes. CTW (2011)
Etienne de Klerk, Monique Laurent
On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems. SIAM J. Optim. 21 (3) (2011)
Monique Laurent, Antonios Varvitsiotis
Computing the Grothendieck constant of some graph classes. Oper. Res. Lett. 39 (6) (2011)
Monique Laurent, Alexander Schrijver
On Leonid Gurvits's Proof for Permanents. Am. Math. Mon. 117 (10) (2010)
Etienne de Klerk, Monique Laurent
Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube. SIAM J. Optim. 20 (6) (2010)
Nebojsa Gvozdenovic, Monique Laurent, Frank Vallentin
Block-diagonal semidefinite programming hierarchies for 0/1 programming. Oper. Res. Lett. 37 (1) (2009)
Jean B. Lasserre, Monique Laurent, Philipp Rostalski
A prolongation-projection algorithm for computing the finite real variety of an ideal. Theor. Comput. Sci. 410 (27-29) (2009)
Nebojsa Gvozdenovic, Monique Laurent
Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization. SIAM J. Optim. 19 (2) (2008)
Monique Laurent, Bernard Mourrain
A Sparse Flat Extension Theorem for Moment Matrices CoRR (2008)
Nebojsa Gvozdenovic, Monique Laurent
The Operator Psi for the Chromatic Number of a Graph. SIAM J. Optim. 19 (2) (2008)
Jean B. Lasserre, Monique Laurent, Philipp Rostalski
Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals. Found. Comput. Math. 8 (5) (2008)
Jean B. Lasserre, Monique Laurent, Philipp Rostalski
Computing the real variety of an ideal: a real algebraic and symbolic-numeric algorithm. SAC (2008)
Monique Laurent
Semidefinite representations for finite varieties. Math. Program. 109 (1) (2007)
Nebojsa Gvozdenovic, Monique Laurent
Semidefinite bounds for the stability number of a graph via sums of squares of polynomials. Math. Program. 110 (1) (2007)
Monique Laurent
Strengthened semidefinite programming bounds for codes. Math. Program. 109 (2-3) (2007)
Etienne de Klerk, Monique Laurent, Pablo A. Parrilo
A PTAS for the minimization of polynomials of fixed degree over the simplex. Theor. Comput. Sci. 361 (2-3) (2006)
Harry Buhrman, Richard Cleve, Monique Laurent, Noah Linden, Alexander Schrijver, Falk Unger
New Limits on Fault-Tolerant Quantum Computation. FOCS (2006)
Dorina Jibetean, Monique Laurent
Semidefinite Approximations for Global Unconstrained Polynomial Optimization. SIAM J. Optim. 16 (2) (2005)
Nebojsa Gvozdenovic, Monique Laurent
Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials. IPCO (2005)
Monique Laurent
Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope. Math. Oper. Res. 28 (4) (2003)
Monique Laurent
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0-1 Programming. Math. Oper. Res. 28 (3) (2003)
Monique Laurent
Tighter Linear and Semidefinite Relaxations for Max-Cut Based on the Lov[a-acute]sz--Schrijver Lift-and-Project Procedure. SIAM J. Optim. 12 (2) (2002)
Monique Laurent
Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems. SIAM J. Matrix Anal. Appl. 22 (3) (2001)
Monique Laurent
On the Sparsity Order of a Graph and Its Deficiency in Chordality. Comb. 21 (4) (2001)
Jack H. Koolen, Monique Laurent, Alexander Schrijver
Equilateral Dimension of the Rectilinear Space. Des. Codes Cryptogr. 21 (1/3) (2000)
Tamás Fleiner, Winfried Hochstättler, Monique Laurent, Martin Loebl
Cycle Bases for Lattices of Binary Matroids with No Fano Dual Minor and Their One-Element Extensions. J. Comb. Theory, Ser. B 77 (1) (1999)
Hans-Jürgen Bandelt, Victor Chepoi, Monique Laurent
Embedding into Rectilinear Spaces. Discret. Comput. Geom. 19 (4) (1998)
Monique Laurent, Svatopluk Poljak, Franz Rendl
Connections between semidefinite relaxations of the max-cut and stable set problems. Math. Program. 77 (1997)
Jack R. Edmonds, Monique Laurent, Alexander Schrijver
A minor-monotone graph parameter based on oriented matroids. Discret. Math. (1997)
Monique Laurent
Cuts, matrix completions and graph rigidity. Math. Program. 79 (1997)
Monique Laurent
Hilbert bases of cuts. Discret. Math. 150 (1-3) (1996)
Monique Laurent, Svatopluk Poljak
Gap Inequalities for the Cut Polytope. Eur. J. Comb. 17 (2-3) (1996)
Monique Laurent
Graphic vertices of the metric polytope. Discret. Math. 151 (1-3) (1996)
Monique Laurent, Svatopluk Poljak
On the Facial Structure of the Set of Correlation Matrices. SIAM J. Matrix Anal. Appl. 17 (3) (1996)
Monique Laurent, Svatopluk Poljak
One-third-integrality in the max-cut problem. Math. Program. 71 (1995)
A. M. H. Gerards, Monique Laurent
A Characterization of Box 1/d-Integral Binary Clutters. J. Comb. Theory, Ser. B 65 (2) (1995)
Michel Deza, Monique Laurent
Hypercube Embedding of Generalized Bipartite Metrics. Discret. Appl. Math. 56 (2-3) (1995)
Cid C. de Souza, Monique Laurent
Some New Classes of Facets for the Equicut Polytope. Discret. Appl. Math. 62 (1-3) (1995)
Hein Vanderholst, Monique Laurent, Alexander Schrijver
On a Minor-Monotone Graph Invariant. J. Comb. Theory, Ser. B 65 (2) (1995)
Caterina De Simone, Michel Deza, Monique Laurent
Collapsing and lifting for the cut cone. Discret. Math. 127 (1-3) (1994)
Michel Deza, Monique Laurent
The even and odd cut polytopes. Discret. Math. 119 (1-3) (1993)
Tayuan Huang, Monique Laurent
(s, r; mu)-nets and alternating forms graphs. Discret. Math. 114 (1-3) (1993)
Michel Deza, Monique Laurent, Svatopluk Poljak
The cut cone III: On the role of triangle facets. Graphs Comb. 9 (2-4) (1993)
Michel Deza, Komei Fukuda, Monique Laurent
The inequicut cone. Discret. Math. 119 (1-3) (1993)
Michel Deza, Viatcheslav P. Grishukhin, Monique Laurent
The hypermetric cone is polydedral. Comb. 13 (4) (1993)
Michel Deza, Viatcheslav P. Grishukhin, Monique Laurent
Hypermetrics in geometry of numbers. Combinatorial Optimization (1993)
Michel Deza, Monique Laurent, Svatopluk Poljak
The cut cone III: On the role of triangle facets. Graphs Comb. 8 (2) (1992)
Michel Deza, Monique Laurent
Facets for the cut cone II: Clique-web inequalities. Math. Program. 56 (1992)
Monique Laurent, Svatopluk Poljak
The Metric Polytope. IPCO (1992)
Michel Deza, Martin Grötschel, Monique Laurent
Clique-Web Facets for Multicut Polytopes. Math. Oper. Res. 17 (4) (1992)
Michel Deza, Monique Laurent
Extension operations for cuts. Discret. Math. (1992)
Michel Deza, Monique Laurent
Facets for the cut cone I. Math. Program. 56 (1992)
Monique Laurent, Antonio Sassano
A characterization of knapsacks with the max-flow- - min-cut property. Oper. Res. Lett. 11 (2) (1992)
Michel Deza, Viatcheslav P. Grishukhin, Monique Laurent
The Symmetries of the Cut Polytope and of Some Relatives. Applied Geometry And Discrete Mathematics (1990)
Michel Deza, Monique Laurent
New Results on Facets of the Cut Cone. IPCO (1990)
Michel Deza, Martin Grötschel, Monique Laurent
Complete Descriptions of Small Multicut Polytopes. Applied Geometry And Discrete Mathematics (1990)
Michele Conforti, Monique Laurent
On the geometric structure of independence systems. Math. Program. 45 (1-3) (1989)
Monique Laurent
A generalization of antiwebs to independence systems and their canonical facets. Math. Program. 45 (1-3) (1989)

Monique Laurent.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Monique Laurent