Recent progress in the application of semidefinite programming to

discrete optimization

Miguel Anjos

The celebrated max-cut algorithm of Goemans and Williamson is 15 years

old in 2009, and its impact in the area of semidefinite programming has been

remarkable. In this talk, we will survey some of the most recent

developments in the application of semidefinite programming to discrete

optimization problems. We will also highlight promising directions for

research in this area.