Copositivity cuts for improving SDP bounds on the clique number (Q2638373): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gap, cosum and product properties of the θ′ bound on the clique number / rank
 
Normal rank
Property / cites work
 
Property / cites work: New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSDP, A C library for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the copositive representation of binary and continuous nonconvex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of the Stability Number of a Graph via Copositive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for graph coloring and maximal clique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sandwich theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Stability Number of a Graph Via Linear and Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of the Delsarte and Lovász bounds / rank
 
Normal rank

Revision as of 04:49, 3 July 2024

scientific article
Language Label Description Also known as
English
Copositivity cuts for improving SDP bounds on the clique number
scientific article

    Statements

    Copositivity cuts for improving SDP bounds on the clique number (English)
    0 references
    0 references
    0 references
    0 references
    16 September 2010
    0 references
    Lovász' bound
    0 references
    semidefinite programming
    0 references
    maximum clique problem
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references