title: Semi-definite programming for discrete optimization abstract: First we will present various instances of hard combinatorial problems where these QQPs arise and then look at different approaches to finding relaxations for them. This includes questions about: how to identify redundant constraints in the problem that will improve the relaxation; and, how to exploit the structure in solution techniques.