Integer polynomial programming using Bernstein bases

We present a subdivision method to solve a system of polynomial equations over the integers. It can treat equalities, inequalities, minimizations and maximizations of several equations in several variables and arbitrary degrees. This method is exponential in the number of variables.