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

Authors:
J. A. De Loera;R. Hemmecke;M. Köppe;R. Weismantel
Affiliations:
University of California, Davis CA;Otto-von-Guericke-Universität Magdeburg, Magdeburg, Germany;Otto-von-Guericke-Universität Magdeburg, Magdeburg, Germany;Otto-von-Guericke-Universität Magdeburg, Magdeburg, Germany
Venue:
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Year:
2006

Citing 4
Cited 0

A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed

Mathematics of Operations Research
Some optimal inapproximability results

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A PTAS for the minimization of polynomials of fixed degree over the simplex

Theoretical Computer Science - Approximation and online algorithms

Quantified Score

Hi-index	0.00

Visualization

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.