We construct convex, semidefinite programming (SDP) relaxations of the convex hull of association schemes with given parameters. As an application, we obtain new and known SDP relaxations of several combinatorial optimizations problems, including the traveling salesman and cycle covering...