Friday, May 3, 2019
85th Anniversary of Jack Edmonds, Panthéon-Sorbonne University
Prof. Ghaddar (Management Sciences) attended the event. She gave a talk on the global optimization approach for binary polynomial programs. In this talk, she presented branch-and-dig, an algorithm to find global solutions for binary polynomial programming problems. She discussed the inequality generating techniques based on lift-and-project relaxations that are developed to speed up the branch-and-bound process and reduce the number of nodes of the tree. Computational results for problems of degree two and degree three were presented to assess the impact of the proposed approach.