Pages that link to "Item:Q3629508"

The following pages link to Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization (Q3629508):

Displaying 16 items.

• New heuristics for the vertex coloring problem based on semidefinite programming (Q351547) (← links)
• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
• Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← links)
• Block-diagonal semidefinite programming hierarchies for 0/1 programming (Q1002080) (← links)
• Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization (Q1650765) (← links)
• Symmetric sums of squares over \(k\)-subset hypercubes (Q1702778) (← links)
• Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) (← links)
• Chromatic Gallai identities operating on Lovász number (Q2452384) (← links)
• The CP-Matrix Approximation Problem (Q2790067) (← links)
• Copositive Programming (Q2802526) (← links)
• Invariant Semidefinite Programs (Q2802527) (← links)
• Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation (Q2815431) (← links)
• (Q2861516) (← links)
• Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
• On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs (Q5081783) (← links)
• Partial Lasserre relaxation for sparse Max-Cut (Q6050383) (← links)