FPTAS for mixed-integer polynomial optimization with a fixed number of   variables
  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. 
Jes\'us A. De Loera (1), Raymond Hemmecke (2), Matthias K\"oppe (2),   Robert Weismantel (2) ((1) UC Davis, (2) IMO Magdeburg)