The Bernstein Branch-and-Prune Algorithm for Constrained Global Optimization of Multivariate Polynomial MINLPs
From MaRDI portal
Publication:2807876
DOI10.1007/978-3-319-32859-1_48zbMath1460.90116OpenAlexW2467358359MaRDI QIDQ2807876
Publication date: 25 May 2016
Published in: Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-32859-1_48
Analysis of algorithms (68W40) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
This page was built for publication: The Bernstein Branch-and-Prune Algorithm for Constrained Global Optimization of Multivariate Polynomial MINLPs