The following pages link to (Q2760093):
Displaying 5 items.
- Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques (Q493691) (← links)
- Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
- On the Slater condition for the SDP relaxations of nonconvex sets (Q1604046) (← links)
- A semidefinite programming-based heuristic for graph coloring (Q2467349) (← links)
- On extracting maximum stable sets in perfect graphs using Lovász's theta function (Q2506178) (← links)
