On the impact of running intersection inequalities for globally solving polynomial optimization problems
From MaRDI portal
Publication:2195679
DOI10.1007/s12532-019-00169-zzbMath1441.90097MaRDI QIDQ2195679
Nikolaos V. Sahinidis, Alberto Del Pia, Aida Khajavirad
Publication date: 27 August 2020
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-019-00169-z
branch-and-cut; polynomial optimization; mixed-integer nonlinear optimization; separation algorithm; multilinear polytope; running-intersection inequalities
90C11: Mixed integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C26: Nonconvex programming, global optimization
Uses Software