## Faizan Ahmad — *Combinatorial Optimization: Cone Relaxations*

Time: | Wednesday, April 21, 2010, 12:45-13:30 |

Location: | Room 101, Citadel |

In this presentation we will give an overview of cone relaxations available for hard combinatorial optimization problems. We will start with the general notion of cone programming and then briefly describe some semidefinite relaxations for combinatorial optimization problems. Then we will move to copositive programming. Our main emphasis will be on copositive relaxations for hard combinatorial optimization problems. We will conclude our presentation with some open problems related to copositive programming.