FPTAS for mixed-integer polynomial optimization with a fixed number of variables
arXiv:math/0505677 · doi:10.1145/1109557.1109638
Abstract
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.
11 pages