Strengthened semidefinite programming bounds for codes

DOI10.1007/s10107-006-0030-3zbMath1147.90034MaRDI QIDQ868466

Monique Laurent

Publication date: 5 March 2007

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-006-0030-3

zbMATH Keywords

Terwilliger algebra; semidefinite programming; stability number; binary code; regular \(*\)-representation

Mathematics Subject Classification ID

90C22: Semidefinite programming

90C27: Combinatorial optimization

94B65: Bounds on codes

Related Items

Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation, Semidefinite bounds for the stability number of a graph via sums of squares of polynomials, Symmetry in semidefinite programs, Block-diagonal semidefinite programming hierarchies for 0/1 programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The subconstituent algebra of an association scheme. I
• Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
• Geometric algorithms and combinatorial optimization
• Symmetry groups, semidefinite programs, and sums of squares
• A note on the stability number of an orthogonality graph
• Global Optimization with Polynomials and the Problem of Moments
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• A comparison of the Delsarte and Lovász bounds
• Cones of Matrices and Set-Functions and 0–1 Optimization
• On the Shannon capacity of a graph
• A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming