Pages that link to "Item:Q2802525"
From MaRDI portal
The following pages link to Relaxations of Combinatorial Problems Via Association Schemes (Q2802525):
Displayed 13 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)
- The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem (Q4577740) (← links)
- Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps (Q5076689) (← links)
- Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem (Q5206234) (← links)
- On semidefinite programming bounds for graph bandwidth (Q5299908) (← links)
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs (Q6044986) (← links)
- On Integrality in Semidefinite Programming for Discrete Optimization (Q6130544) (← links)