Pages that link to "Item:Q2802525"

The following pages link to Relaxations of Combinatorial Problems Via Association Schemes (Q2802525):

Displaying 10 items.

• The independence number for polarity graphs of even order planes (Q356737) (← links)
• Symmetry in Turán sums of squares polynomials from flag algebras (Q1637376) (← links)
• Graph bisection revisited (Q1657405) (← links)
• Gaddum's test for symmetric cones (Q2022297) (← links)
• Semidefinite programming and eigenvalue bounds for the graph partition problem (Q2349129) (← links)
• Minimum energy configurations on a toric lattice as a quadratic assignment problem (Q2673239) (← links)
• An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612) (← links)
• Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps (Q5076689) (← links)
• Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs (Q6044986) (← links)
• On Integrality in Semidefinite Programming for Discrete Optimization (Q6130544) (← links)