Box-Constrained Mixed-Integer Polynomial Optimization Using Separable Underestimators

DOI10.1007/978-3-319-07557-0_17zbMath1418.90175OpenAlexW122852371MaRDI QIDQ5418996

Christoph Buchheim, Claudia D'Ambrosio

Publication date: 2 June 2014

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-07557-0_17

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items (2)

Norm bounds and underestimators for unconstrained polynomial integer minimization ⋮ Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization

This page was built for publication: Box-Constrained Mixed-Integer Polynomial Optimization Using Separable Underestimators