Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
type: Item
instance of: scholarly article
title: Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
zbMATH Open document ID: 1113.90117
author: Nebojša Gvozdenović
author: Monique Laurent
published in: Mathematical Programming. Series A. Series B
publication date: 2007-04-19T00:00:00Z
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5145058
describes a project that uses: QUALEX
MaRDI profile type: Publication
full work available at URL: s10107-006-0062-8
OpenAlex ID: W4246855957
cites work: Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
cites work: Semidefinite Programming
cites work: A new trust region technique for the maximum weight clique problem
cites work: Q5707657
cites work: Approximation of the stability number of a graph via copositive programming
cites work: Geometric algorithms and combinatorial optimization
cites work: Global optimization with polynomials and the problem of moments
cites work: Q4537750
cites work: A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
cites work: Strengthened semidefinite programming bounds for codes
cites work: Q5292090
cites work: On the Shannon capacity of a graph
cites work: Cones of Matrices and Set-Functions and 0–1 Optimization
cites work: Q4194987
cites work: Maxima for Graphs and a New Proof of a Theorem of Turán
cites work: Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
cites work: Q4496287
cites work: Sums of even powers of real linear forms
cites work: A comparison of the Delsarte and Lovász bounds
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
cites work: Optimization of Polynomials on Compact Semialgebraic Sets
cites work: Handbook of semidefinite programming. Theory, algorithms, and applications
cites work: LMI Approximations for Cones of Positive Semidefinite Forms
DOI: 10.1007/S10107-006-0062-8
Recommended article: Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials
Recommended article: Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
Recommended article: Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph
Recommended article: Lower bounds on the stability number of graphs computed in terms of degrees
Recommended article: Approximation of the stability number of a graph via copositive programming
Recommended article: A survey on graphs with convex quadratic stability number
Recommended article: Certificates for properties of stability polynomials of graphs
Recommended article: Q5243845
Recommended article: Graphs with least eigenvalue \(-2\) attaining a convex quadratic upper bound for the stability number
Recommended article: Bounds on the Stability Number of a Graph via the Inverse Theta Function
description: scientific article; zbMATH DE number 5145058