Monique Laurent
Orcid: 0000-0001-8474-2121Affiliations:
- Tilburg University, The Netherlands
- Centrum Wiskunde & Informatica
According to our database1,
Monique Laurent
authored at least 100 papers
between 1984 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
-
on isni.org
On csauthors.net:
Bibliography
2025
Math. Oper. Res., 2025
2024
Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks.
Math. Program., May, 2024
2023
Exactness of Parrilo's Conic Approximations for Copositive Matrices and Associated Low Order Bounds for the Stability Number of a Graph.
Math. Oper. Res., May, 2023
Optim. Lett., April, 2023
2022
Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph.
SIAM J. Optim., 2022
Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets.
Math. Program., 2022
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere.
Math. Program., 2022
2021
Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling.
SIAM J. Optim., 2021
Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization.
Math. Program., 2021
Proceedings of the Integer Programming and Combinatorial Optimization, 2021
2020
Worst-Case Examples for Lasserre's Measure-Based Hierarchy for Polynomial Optimization on the Hypercube.
Math. Oper. Res., 2020
2019
Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization.
Found. Comput. Math., 2019
Eur. J. Comb., 2019
2018
Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization.
Math. Program., 2018
Comparison of Lasserre's Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing.
Math. Oper. Res., 2018
2017
Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization.
SIAM J. Optim., 2017
Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition.
SIAM J. Discret. Math., 2017
Optim. Lett., 2017
Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization.
Math. Program., 2017
Math. Oper. Res., 2017
Electron. J. Comb., 2017
2015
IEEE Trans. Inf. Theory, 2015
Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone.
SIAM J. Optim., 2015
An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution.
SIAM J. Optim., 2015
The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure.
Oper. Res. Lett., 2015
An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex.
Math. Program., 2015
On the Closure of the Completely Positive Semidefinite Cone and Linear Approximations to Quantum Colorings.
Proceedings of the 10th Conference on the Theory of Quantum Computation, 2015
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015
2014
A new graph parameter related to bounded rank positive semidefinite matrix completions.
Math. Program., 2014
Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope.
J. Comb. Theory B, 2014
2013
Handelman's hierarchy for the maximum stable set problem.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013
2012
A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs.
Math. Program., 2012
On bounded rank positive semidefinite matrix completions of extreme partial correlation matrices
CoRR, 2012
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012
2011
On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems.
SIAM J. Optim., 2011
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011
2010
Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube.
SIAM J. Optim., 2010
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
A prolongation-projection algorithm for computing the finite real variety of an ideal.
Theor. Comput. Sci., 2009
Oper. Res. Lett., 2009
2008
Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization.
SIAM J. Optim., 2008
Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals.
Found. Comput. Math., 2008
Computing the real variety of an ideal: a real algebraic and symbolic-numeric algorithm.
Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), 2008
2007
2006
Theor. Comput. Sci., 2006
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, 2006
2005
SIAM J. Optim., 2005
Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005
2004
2003
Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope.
Math. Oper. Res., 2003
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0-1 Programming.
Math. Oper. Res., 2003
2002
Tighter Linear and Semidefinite Relaxations for Max-Cut Based on the Lov[a-acute]sz--Schrijver Lift-and-Project Procedure.
SIAM J. Optim., 2002
2001
Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems.
SIAM J. Matrix Anal. Appl., 2001
2000
Equilateral Dimension of the Rectilinear Space.
Des. Codes Cryptogr., 2000
1999
Cycle Bases for Lattices of Binary Matroids with No Fano Dual Minor and Their One-Element Extensions.
J. Comb. Theory B, 1999
1998
1997
Math. Program., 1997
Geometry of cuts and metrics.
Algorithms and combinatorics 15, Springer, ISBN: 978-3-540-61611-5, 1997
1996
SIAM J. Matrix Anal. Appl., 1996
1995
1994
1993
Proceedings of the Combinatorial Optimization, 1993
1992
Oper. Res. Lett., 1992
The Metric Polytope.
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992
1990
New Results on Facets of the Cut Cone.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990
Proceedings of the Applied Geometry And Discrete Mathematics, 1990
Proceedings of the Applied Geometry And Discrete Mathematics, 1990
1989
Math. Program., 1989
Discret. Math., 1989
1988
1986
1984
Possible DNA modification in GC dinucleotides of Trypanosoma brucei telomeric sequences; relationship with antigen gene transcription.
Nucleic Acids Res., 1984