|
|
Mardi 3 Décembre
Heure: |
12:00 - 13:30 |
Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
Résumé: |
A branch-and-bound method for box constrained integer polynomial optimization |
Description: |
Claudia D'Ambrosio We consider the problem of minimizing an arbitrary polynomial subject to box and integrality constraints. We propose a new class of under-estimators composed of separable functions of the original variables and use it within a branch-and-bound scheme to easily and quickly compute lower bounds. Computational results on randomly generated instances show good performance with respect to the ones of different open-source solvers like Couenne, Gloptipoly , and SCIP. Moreover, the second part of the talk will be devoted to present a different perspective on partially separable problems. In particula, an exact algorithm for mixed integer non-linear programming problems with separable non-convexities will be presented. |
|
|