Monday, 15:15 - 15:40 h, Room: H 2053


Bissan Ghaddar
A global optimization approach for binary polynomial programs

Coauthor: Juan Vera


In this talk, we present branch-and-dig, an algorithm to find global solutions for binary polynomial programming problems. Inequality generating techniques based on lift-and-project relaxations are developed for binary polynomial problems which can help speed up the branch-and-bound process by improving the bounds at each node, thus reducing the number of nodes of the tree. Computational results for small test problems of degree three are given. In the computational study, we investigate the performance of different branching rules and the impact of the dynamic inequality generation scheme.


Talk 1 of the invited session Mon.3.H 2053
"Algorithms and relaxations for nonconvex optimization Problems" [...]
Cluster 9
"Global optimization" [...]


  There are three major facts that should be watched out for in all payday loans in the United States. But it is worth noting that these tests were carried out on the blood cells. Therefore, it's too early to say about scientific evidence of Viagra influence on blood clots.