In this chapter we study a class of semidefinite programming relaxations of combinatorial problems. These relaxations are derived using the theory of coherent configurations in algebraic combinatorics.
Draft version of a chapter for "Handbook on SDP II" (M. Anjos and J. Lasserre, eds.), Springer.
View Relaxations of combinatorial problems via association schemes