FPTAS for mixed-integer polynomial optimization with a fixed number of variables

Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe +1

We show the existence of an FPTAS for the problem of maximizing a non-negative polynomial over mixed-integer sets in convex polytopes, when the number of variables is fixed.