1986 …2020

Research output per year

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

Research Output

Article

(s, r; μ)-nets and alternating forms graphs

Huang, T. & Laurent, M., 1993, In : Discrete Mathematics. 114, 1-3, p. 237-252

Research output: Contribution to journalArticleProfessional

File
3 Citations (Scopus)
25 Downloads (Pure)

A characterization of box 1/d-integral binary clutters

Gerards, A. M. H. & Laurent, M., 1995, In : Journal of Combinatorial Theory, Series B, Graph theory. 65, 2, p. 186-207

Research output: Contribution to journalArticleProfessional

File
5 Citations (Scopus)
29 Downloads (Pure)

A characterization of knapsacks with the max-flow-min-cut property

Laurent, M. & Sassano, A., 1992, In : Operations Research Letters. 11, 2, p. 105-110

Research output: Contribution to journalArticleProfessional

File
12 Citations (Scopus)
60 Downloads (Pure)

A characterization of matroidal systems of inequalities

Conforti, M. & Laurent, M., 1988, In : Discrete Mathematics. 69, 2, p. 165-171

Research output: Contribution to journalArticleProfessional

File
13 Downloads (Pure)

A comparison of the Sherali-Adams, Lov´asz-Schrijver and Lasserre relaxations for 0-1 programming

Laurent, M., 2003, In : Mathematics of Operations Research. 28, 3, p. 470-496 27 p.

Research output: Contribution to journalArticleProfessional

File
198 Citations (Scopus)
156 Downloads (Pure)

A connection between positive semidefinite and Euclidean distance matrix completion problems

Laurent, M., 1998, In : Linear Algebra and its Applications. 273, 1-3, p. 9-22

Research output: Contribution to journalArticleProfessional

File
27 Citations (Scopus)
45 Downloads (Pure)

A generalization of antiwebs to independence systems and their canonical facets

Laurent, M., 1989, In : Mathematical Programming. 45, 1-3, p. 97-108

Research output: Contribution to journalArticleProfessional

File
29 Citations (Scopus)
65 Downloads (Pure)

A generalized flat extension theorem for moment matrices

Laurent, M. & Mourrain, B., 2009, In : Archiv der Mathematik. 93, 1, p. 87-98

Research output: Contribution to journalArticleScientificpeer-review

File
24 Citations (Scopus)
228 Downloads (Pure)

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

4 Citations (Scopus)

A minor-monotone graph parameter based on oriented matroids

Edmonds, J., Laurent, M. & Schrijver, A., 1997, In : Discrete Mathematics. 165-166, p. 219-226

Research output: Contribution to journalArticleProfessional

File
2 Citations (Scopus)
30 Downloads (Pure)

An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex

de Klerk, E., Laurent, M. & Sun, Z., Jul 2015, In : Mathematical Programming. 151, 2, p. 433-457 24 p.

Research output: Contribution to journalArticleScientificpeer-review

9 Citations (Scopus)

An error analysis for polynomial optimization over the simplex based on the multivariate hypergeometric distribution.

de Klerk, E., Laurent, M. & Sun, Z., 2015, In : SIAM Journal on Optimization. 25, 3, p. 1498-1514 17 p.

Research output: Contribution to journalArticleScientificpeer-review

7 Citations (Scopus)

A new graph parameter related to bounded rank positive semidefinite matrix completions

Laurent, M. & Varvitsiotis, A., Jun 2014, In : Mathematical Programming. 145, 1-2, p. 291-325

Research output: Contribution to journalArticleScientificpeer-review

15 Citations (Scopus)

A new semidefinite programming relaxation for cycles in binary matroids and cuts in graphs

Gouveia, J., Laurent, M., Parrilo, P. & Thomas, R., 2012, In : Mathematical Programming. 133, 1-2, p. 203-225

Research output: Contribution to journalArticleScientificpeer-review

File
10 Citations (Scopus)
239 Downloads (Pure)

Applications of cut polyhedra - I

Deza, M. M. & Laurent, M., 1994, In : Journal of Computational and Applied Mathematics. 55, 2, p. 191-216

Research output: Contribution to journalArticleProfessional

File
21 Citations (Scopus)
131 Downloads (Pure)

Applications of cut polyhedra - II

Deza, M. M. & Laurent, M., 1994, In : Journal of Computational and Applied Mathematics. 55, 2, p. 217-247

Research output: Contribution to journalArticleProfessional

File
21 Citations (Scopus)
56 Downloads (Pure)

A prolongation-projection algorithm for computing the finite real variety of an ideal

Lasserre, J. B., Laurent, M. & Rostalski, P., 2009, In : Theoretical Computer Science: The journal of the EATCS. 410, 27/29, p. 2685-2700

Research output: Contribution to journalArticleScientificpeer-review

13 Citations (Scopus)

A PTAS for the minimization of polynomials of fixed degree over the simplex

de Klerk, E., Laurent, M. & Parrilo, P., 2006, In : Theoretical Computer Science: The journal of the EATCS. 361, 2-3, p. 210-225

Research output: Contribution to journalArticleScientificpeer-review

File
50 Citations (Scopus)
255 Downloads (Pure)

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
1 Citation (Scopus)
43 Downloads (Pure)

Block-diagonal semidenfinite programming hierarchies for 0/1 programming

Gvozdenovic, N., Laurent, M. & Vallentin, F., 2009, In : Operations Research Letters. 37, 1, p. 27-31

Research output: Contribution to journalArticleScientificpeer-review

File
6 Citations (Scopus)
305 Downloads (Pure)

Bound-constrained polynomial optimization using only elementary calculations

de Klerk, E., Lasserre, J. B., Laurent, M. & Sun, Z., Aug 2017, In : Mathematics of Operations Research. 42, 3, p. 834-853

Research output: Contribution to journalArticleScientificpeer-review

10 Citations (Scopus)

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
1 Citation (Scopus)

Bouquets of geometric lattices: Some algebraic and topological aspects

Deza, M. M. & Laurent, M., 1989, In : Discrete Mathematics. 75, 1-3, p. 279-313 35 p.

Research output: Contribution to journalArticleProfessional

File
1 Citation (Scopus)
13 Downloads (Pure)

Bouquets of matroids, d-injection geometries and diagrams

Deza, M. M. & Laurent, M., 1987, In : Journal of Geometry. 29, 1, p. 12-35

Research output: Contribution to journalArticleProfessional

File
5 Citations (Scopus)
16 Downloads (Pure)

Clique-web facets for multicut polytopes

Deza, M. M., Grötschel, M. & Laurent, M., 1992, In : Mathematics of Operations Research. 17, 4, p. 981-1000 20 p.

Research output: Contribution to journalArticleProfessional

File
5 Downloads (Pure)

Collapsing and lifting for the cut cone

de Simone, C., Deza, M. M. & Laurent, M., 1994, In : Discrete Mathematics. 127, 1-3, p. 105-130

Research output: Contribution to journalArticleProfessional

File
6 Citations (Scopus)
14 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
5 Citations (Scopus)
80 Downloads (Pure)

Computing semidefinite programming lower bounds for the (fractional) chromatic number via block-diagonalization

Gvozdenović, N. & Laurent, M., 2008, In : SIAM Journal on Optimization. 19, 2, p. 592-615 24 p.

Research output: Contribution to journalArticleProfessional

File
17 Citations (Scopus)
32 Downloads (Pure)

Computing the Grothendieck constant of some graph classes

Laurent, M. & Varvitsiotis, A., 2011, In : Operations Research Letters. 39, 6, p. 452-456

Research output: Contribution to journalArticleScientificpeer-review

2 Citations (Scopus)

Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone

Laurent, M. & Piovesan, T., 2015, In : SIAM Journal on Optimization. 25, 4, p. 2461-2493

Research output: Contribution to journalArticleScientificpeer-review

18 Citations (Scopus)

Connections between semidefinite relaxations of the max-cut and stable set problems

Laurent, M., Poljak, S. & Rendl, F., 1997, In : Mathematical Programming. 77, 2, p. 225-246

Research output: Contribution to journalArticleProfessional

File
14 Downloads (Pure)

Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization

de Klerk, E., Laurent, M. & Sun, Z., Mar 2017, In : Mathematical Programming . 162, 1, p. 363-392

Research output: Contribution to journalArticleScientificpeer-review

11 Citations (Scopus)

Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere

de Klerk, E. & Laurent, M., Jan 2020, In : Mathematical Programming .

Research output: Contribution to journalArticleScientificpeer-review

Open Access

Copositive vs. moment hierarchies for stable sets

Laurent, M., 2012, In : Optima: Mathematical Optimization Society Newsletter. 89, p. 8-9

Research output: Contribution to journalArticleProfessional

Cuts, matrix completions and graph rigidity

Laurent, M., 1997, In : Mathematical Programming. 79, 1-3, p. 255-283

Research output: Contribution to journalArticleProfessional

File
22 Citations (Scopus)
154 Downloads (Pure)

Cycle bases for lattices of binary matroids with no Fano dual minor and their one-element extensions

Fleiner, T., Hochstättler, W., Laurent, M. & Loebl, M., 1999, In : Journal of Combinatorial Theory, Series B, Graph theory. 77, 1, p. 25-38

Research output: Contribution to journalArticleProfessional

File
1 Citation (Scopus)
33 Downloads (Pure)

Delaunay transformations of a Delaunay polytope

Laurent, M., 1996, In : Journal of Algebraic Combinatorics. 5, 1, p. 37-46

Research output: Contribution to journalArticleProfessional

File
12 Downloads (Pure)

Embedding into rectilinear spaces

Bandelt, H-J., Chepoi, V. & Laurent, M., 1998, In : Discrete and Computational Geometry. 19, 4, p. 595-604

Research output: Contribution to journalArticleProfessional

19 Citations (Scopus)

Entanglement-assisted zero-error source-channel coding

Briet, J., Buhrman, H., Laurent, M., Piovesan, T. & Scarpa, G., 16 Jan 2015, In : IEEE Transactions on Information Theory. 61, 2, p. 1124-1138

Research output: Contribution to journalArticleScientificpeer-review

7 Citations (Scopus)

Equilateral dimension of the rectilinear space

Koolen, J., Laurent, M. & Schrijver, A., 2000, In : Designs, Codes and Cryptography. 21, 1-3, p. 149-164

Research output: Contribution to journalArticleProfessional

File
9 Citations (Scopus)
44 Downloads (Pure)

Error bounds for some semidefinite programming approaches to polynomial minimization on the hypercube

de Klerk, E. & Laurent, M., 2010, In : SIAM Journal on Optimization. 20, 6, p. 3104-3120

Research output: Contribution to journalArticleScientificpeer-review

File
27 Citations (Scopus)
241 Downloads (Pure)

Extension operations for cuts

Deza, M. M. & Laurent, M., 1992, In : Discrete Mathematics. 106-107, p. 163-179

Research output: Contribution to journalArticleProfessional

File
9 Citations (Scopus)
20 Downloads (Pure)

Facets for the cut cone I

Deza, M. M. & Laurent, M., 1992, In : Mathematical Programming. 56, 1-3, p. 121-160

Research output: Contribution to journalArticleProfessional

File
75 Downloads (Pure)

Facets for the cut cone II: Clique-web inequalities

Deza, M. M. & Laurent, M., 1992, In : Mathematical Programming. 56, 1-3, p. 161-188

Research output: Contribution to journalArticleProfessional

File
82 Downloads (Pure)

Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope

Nagy, M., Laurent, M. & Varvitsiotis, A., Sep 2014, In : Journal of Combinatorial Theory, Series B, Graph theory. 108, September 2014, p. 40-80

Research output: Contribution to journalArticleScientificpeer-review

5 Citations (Scopus)

Gap inequalities for the cut polytope

Laurent, M. & Poljak, S., 1996, In : European Journal of Combinatorics. 17, 2-3, p. 233-254

Research output: Contribution to journalArticleProfessional

File
10 Citations (Scopus)
28 Downloads (Pure)

Graphic vertices of the metric polytope

Laurent, M., 1996, In : Discrete Mathematics. 151, 1-3, p. 131-153

Research output: Contribution to journalArticleProfessional

File
10 Citations (Scopus)
6 Downloads (Pure)

Handelman's hierarchy for the maximum stable set problem

Laurent, M. & Sun, Z., 2014, In : Journal of Global Optimization. 60, 3, p. 393-423

Research output: Contribution to journalArticleScientificpeer-review

2 Citations (Scopus)

Hilbert bases of cuts

Laurent, M., 1996, In : Discrete Mathematics. 150, 1-3, p. 257-279

Research output: Contribution to journalArticleProfessional

File
3 Citations (Scopus)
67 Downloads (Pure)

Hypercube embedding of generalized bipartite metrics

Deza, M. M. & Laurent, M., 1995, In : Discrete Applied Mathematics. 56, 2-3, p. 215-230

Research output: Contribution to journalArticleProfessional

File
1 Citation (Scopus)
12 Downloads (Pure)