Pages that link to "Item:Q868466"
From MaRDI portal
The following pages link to Strengthened semidefinite programming bounds for codes (Q868466):
Displaying 16 items.
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming (Q717133) (← links)
- Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← links)
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation (Q868475) (← links)
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials (Q877197) (← links)
- Symmetry in semidefinite programs (Q958029) (← links)
- Block-diagonal semidefinite programming hierarchies for 0/1 programming (Q1002080) (← links)
- Commutative association schemes (Q1039424) (← links)
- Exploiting special structure in semidefinite programming: a survey of theory and applications (Q1044129) (← links)
- Symmetric sums of squares over \(k\)-subset hypercubes (Q1702778) (← links)
- Exploiting symmetry in copositive programs via semidefinite hierarchies (Q2349140) (← links)
- Invariant Semidefinite Programs (Q2802527) (← links)
- Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling (Q5152478) (← links)
- Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory (Q5864695) (← links)
- Semidefinite programming bounds for binary codes from a split Terwilliger algebra (Q6074024) (← links)
- New lower bounds on crossing numbers of \(K_{m,n}\) from semidefinite programming (Q6608048) (← links)
