FPTAS for mixed-integer polynomial optimization with a fixed number of variables
Optimization and Control
2017-01-03 v1
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.
Cite
@article{arxiv.math/0505677,
title = {FPTAS for mixed-integer polynomial optimization with a fixed number of variables},
author = {Jesús A. De Loera and Raymond Hemmecke and Matthias Köppe and Robert Weismantel},
journal= {arXiv preprint arXiv:math/0505677},
year = {2017}
}
Comments
11 pages