Jeudi 9 Février


Retour à la vue des calendrier
Jeudi 9 Février
Heure: 10:30 - 11:30
Lieu: Salle B107, bâtiment B, Université de Villetaneuse
Résumé: QP/NLP-based Branch-and-Bound algorithm for MINLP: It could work!
Description: Luca Mencarelli We describe a novel QP/NLP-based Branch-and-Bound algorithm for convex MINLP. Then, we introduce a tailored version of the previous algorithm for (non-convex) Binary Nonlinear Optimization Problems (BNPs), relying on a simple convexification procedure and a tailor convex quadratic under-approximation. We survey computational experiences on convex instances of MINLPLib and on several literature and random generated instances for BNPs.