The following pages link to Monique Laurent (Q344892):
Displaying 50 items.
- A characterization of box \(\frac 1d\)-integral binary clutters (Q1907098) (← links)
- On a minor-monotone graph invariant (Q1907104) (← links)
- Gap inequalities for the cut polytope (Q1911843) (← links)
- Hilbert bases of cuts (Q1916115) (← links)
- Graphic vertices of the metric polytope (Q1916387) (← links)
- One-third-integrality in the max-cut problem (Q1924057) (← links)
- Moment matrices, border bases and real radical computation (Q1940922) (← links)
- Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization (Q2044964) (← links)
- Bounding the separable rank via polynomial optimization (Q2144234) (← links)
- Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere (Q2144547) (← links)
- Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets (Q2144552) (← links)
- On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices (Q2158273) (← links)
- Perfect elimination orderings for symmetric matrices (Q2174877) (← links)
- A new graph parameter related to bounded rank positive semidefinite matrix completions (Q2248754) (← links)
- On the linear extension complexity of stable set polytopes for perfect graphs (Q2311370) (← links)
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
- An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex (Q2349131) (← links)
- Positive semidefinite matrix completion, universal rigidity and the strong Arnold property (Q2451678) (← links)
- A PTAS for the minimization of polynomials of fixed degree over the simplex (Q2503350) (← links)
- An effective version of Schmüdgen's Positivstellensatz for the hypercube (Q2693779) (← links)
- Polynomial instances of the positive semidefinite and Euclidean distance matrix completion problems (Q2706294) (← links)
- Tighter linear and semidefinite relaxations for max-cut based on the Lovász-Schrijver lift-and-project procedure (Q2784415) (← links)
- The Approach of Moments for Polynomial Equations (Q2802518) (← links)
- Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint (Q2848995) (← links)
- Semidefinite programming in combinatorial and polynomial optimization (Q2889301) (← links)
- Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization (Q2968176) (← links)
- Entanglement-Assisted Zero-Error Source-Channel Coding (Q2978794) (← links)
- On Leonid Gurvits’s Proof for Permanents (Q3069248) (← links)
- Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube (Q3083323) (← links)
- On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems (Q3105776) (← links)
- (Q3113173) (← links)
- (Q3137180) (← links)
- (Q3137370) (← links)
- The Gram Dimension of a Graph (Q3167639) (← links)
- A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis (Q3296188) (← links)
- Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone (Q3457190) (← links)
- Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials (Q3596364) (← links)
- (Q3601989) (← links)
- (Q3601990) (← links)
- The Operator $\Psi$ for the Chromatic Number of a Graph (Q3629507) (← links)
- Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization (Q3629508) (← links)
- On the Facial Structure of Independence System Polyhedra (Q3823409) (← links)
- The symmetries of the cut polytope and of some relatives (Q3974968) (← links)
- Complete descriptions of small multicut polytopes (Q3974969) (← links)
- The Fibonacci and parachute inequalities for \(\ell_ 1\)-metrics (Q3991000) (← links)
- Clique-Web Facets for Multicut Polytopes (Q4027782) (← links)
- (Q4320817) (← links)
- (Q4398372) (← links)
- (Q4400638) (← links)
- (Q4589032) (← links)
