Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
From MaRDI portal
Publication:877197
Recommendations
- Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- Finite convergence of sum-of-squares hierarchies for the stability number of a graph
- Lower bounds on the stability number of graphs computed in terms of degrees
- Approximation of the stability number of a graph via copositive programming
- A survey on graphs with convex quadratic stability number
- Certificates for properties of stability polynomials of graphs
- On the stability of common neighbor polynomial of some graphs
- Graphs with least eigenvalue \(-2\) attaining a convex quadratic upper bound for the stability number
- Bounds on the stability number of a graph via the inverse theta function
Cites work
- scientific article; zbMATH DE number 3634289 (Why is no real title available?)
- scientific article; zbMATH DE number 1490041 (Why is no real title available?)
- scientific article; zbMATH DE number 1757962 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- A comparison of the Delsarte and Lovász bounds
- A new trust region technique for the maximum weight clique problem
- Approximation of the stability number of a graph via copositive programming
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Geometric algorithms and combinatorial optimization
- Global optimization with polynomials and the problem of moments
- Handbook of semidefinite programming. Theory, algorithms, and applications
- LMI Approximations for Cones of Positive Semidefinite Forms
- Maxima for Graphs and a New Proof of a Theorem of Turán
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- On the Shannon capacity of a graph
- Optimization of Polynomials on Compact Semialgebraic Sets
- Semidefinite Programming
- Semidefinite programming and integer programming
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Strengthened semidefinite programming bounds for codes
- Sums of even powers of real linear forms
Cited in
(18)- On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices
- A comprehensive analysis of polyhedral lift-and-project methods
- Sum of squares basis pursuit with linear and second order cone programming
- Sum-of-squares certificates for copositivity via test states
- A note on the Lasserre hierarchy for different formulations of the maximum independent set problem
- Independent sets in graphs
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- Finite convergence of sum-of-squares hierarchies for the stability number of a graph
- Computing the distance between the linear matrix pencil and the completely positive cone
- Mathematical programming models and exact algorithms
- Exactness of Parrilo’s Conic Approximations for Copositive Matrices and Associated Low Order Bounds for the Stability Number of a Graph
- Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs
- Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials
- Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope
- A new branch-and-bound algorithm for standard quadratic programming problems
- Handelman's hierarchy for the maximum stable set problem
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
- Approximation hierarchies for copositive cone over symmetric cone and their comparison
This page was built for publication: Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877197)
