Pages that link to "Item:Q1969297"

The following pages link to Semidefinite programs and association schemes (Q1969297):

Displaying 9 items.

• Max-cut and extendability of matchings in distance-regular graphs (Q518196) (← links)
• New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
• Exploiting special structure in semidefinite programming: a survey of theory and applications (Q1044129) (← links)
• A semidefinite programming approach to a cross-intersection problem with measures (Q1683683) (← links)
• Semidefinite programming and eigenvalue bounds for the graph partition problem (Q2349129) (← links)
• Algorithmic and explicit determination of the Lovász number for certain circulant graphs (Q2383537) (← links)
• Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra (Q2462348) (← links)
• Optimal distortion embeddings of distance regular graphs into Euclidean spaces (Q2464155) (← links)
• The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem (Q4577740) (← links)