Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
From MaRDI portal
(Redirected from Publication:5444282)
Recommendations
- Approximation of the stability number of a graph via copositive programming
- An SDP-based approach for computing the stability number of a graph
- On LP-based approximation for copositive formulation of stable set problem
- Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
Cited in
(67)- On the polyhedral lift-and-project methods and the fractional stable set polytope
- LP-oriented upper bounds for the weighted stability number of a graph
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
- Separating doubly nonnegative and completely positive matrices
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
- An SDP-based approach for computing the stability number of a graph
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations
- On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices
- Testing copositivity via mixed-integer linear programming
- Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations
- Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices
- Completely positive reformulations for polynomial optimization
- Exploiting symmetry in copositive programs via semidefinite hierarchies
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
- Approximating the cone of copositive kernels to estimate the stability number of infinite graphs
- A new certificate for copositivity
- A new approximation hierarchy for polynomial conic optimization
- Factorization and cutting planes for completely positive matrices by copositive projection
- New approximations for the cone of copositive matrices and its dual
- A dynamic inequality generation scheme for polynomial programming
- Copositivity cuts for improving SDP bounds on the clique number
- Extended and discretized formulations for the maximum clique problem
- Generating irreducible copositive matrices using the stable set problem
- Approximation of the stability number of a graph via copositive programming
- A comprehensive analysis of polyhedral lift-and-project methods
- Cutting planes for semidefinite relaxations based on triangle-free subgraphs
- Copositive programming
- Some experiences with solving semidefinite programming relaxations of binary quadratic optimization models in computational biology
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
- Computing the distance between the linear matrix pencil and the completely positive cone
- Gap, cosum and product properties of the \(\theta ^{\prime}\) bound on the clique number
- On LP-based approximation for copositive formulation of stable set problem
- Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials
- scientific article; zbMATH DE number 3987328 (Why is no real title available?)
- Scaling relationship between the copositive cone and Parrilo's first level approximation
- Copositivity and constrained fractional quadratic problems
- Copositive optimization -- recent developments and applications
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- An improved algorithm to test copositivity
- A new branch-and-bound algorithm for standard quadratic programming problems
- Handelman's hierarchy for the maximum stable set problem
- A refined error analysis for fixed-degree polynomial optimization over the simplex
- Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
- Finite convergence of sum-of-squares hierarchies for the stability number of a graph
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
- Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs
- A Sum of Squares Characterization of Perfect Graphs
- Optimization under uncertainty and risk: quadratic and copositive approaches
- (Global) optimization: historical notes and recent developments
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- Approximation hierarchies for copositive cone over symmetric cone and their comparison
- Approximation of the Shannon capacity via matrix cone programming
- Copositive tensor optimization problem and its applications to hypergraphs
- On the longest chain of faces of the completely positive and copositive cones
- Sum-of-squares certificates for copositivity via test states
- Computational complexity of sum-of-squares bounds for copositive programs
- Optimization hierarchies for distance-avoiding sets in compact spaces
- On rank-monotone graph operations and minimal obstruction graphs for the Lovász-Schrijver SDP hierarchy
- Stable set polytopes with high lift-and-project ranks for the Lovász-Schrijver SPD operator
- Copositive matrices, sums of squares and the stability number of a graph
- Relaxations of KKT conditions do not strengthen finite RLT and SDP-RLT bounds for nonconvex quadratic programs
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- Copositive programming motivated bounds on the stability and the chromatic numbers
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
- Interiors of completely positive cones
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
This page was built for publication: Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5444282)
