Résumé
We review the Quadratic Convex Reformulation approach for binary quadratic programs. We show that it can be viewed in a unified framework with linearization. We then present extensions to the general integers and mixed variables cases and to problems with quadratic constraints.
We give some numerical results showing the efficiency of the approach.

---------------------------------------

Important

This seminar will give you the opportunity to meet the speaker and all the researchers in attendance while enjoying drinks and snacks.
We would highly appreciate if you could confirm your attendance (http://doodle.com/h675fxyq2cfx4bq5).