Integer Polynomial Optimization in Fixed Dimension
@article{Loera2006IntegerPO, title={Integer Polynomial Optimization in Fixed Dimension}, author={J. D. Loera and R. Hemmecke and M. K{\"o}ppe and R. Weismantel}, journal={Math. Oper. Res.}, year={2006}, volume={31}, pages={147-153} }
We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients, and the number of variables is fixed. For the optimization of an integer polynomial over the lattice points of a convex polytope, we show an algorithm to compute lower and upper bounds for the optimal value. For polynomials that are nonnegative over the polytope, these sequences of bounds lead to a fully polynomial-time… CONTINUE READING
Figures and Topics from this paper
61 Citations
FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
- Mathematics, Computer Science
- Math. Program.
- 2008
- 21
- PDF
FPTAS for mixed-integer polynomial optimization with a fixed number of variables
- Mathematics, Computer Science
- SODA '06
- 2006
- 10
- PDF
Norm bounds and underestimators for unconstrained polynomial integer minimization
- Mathematics, Computer Science
- Math. Methods Oper. Res.
- 2018
- 4
- PDF
When is rounding allowed in integer nonlinear optimization?
- Mathematics, Computer Science
- Eur. J. Oper. Res.
- 2014
- 17
Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane
- Mathematics, Computer Science
- Math. Oper. Res.
- 2016
- 8
- PDF
References
SHOWING 1-10 OF 24 REFERENCES
Integer Optimization on Convex Semialgebraic Sets
- Mathematics, Computer Science
- Discret. Comput. Geom.
- 2000
- 61
- PDF
Minimizing Polynomial Functions
- Mathematics, Computer Science
- Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science
- 2001
- 334
- PDF
Integer Programming with a Fixed Number of Variables
- Mathematics, Computer Science
- Math. Oper. Res.
- 1983
- 1,310
- PDF
Computing the Ehrhart quasi-polynomial of a rational simplex
- Mathematics, Computer Science
- Math. Comput.
- 2006
- 63
- Highly Influential
- PDF
Global Optimization with Polynomials and the Problem of Moments
- Mathematics, Computer Science
- SIAM J. Optim.
- 2001
- 2,180
- PDF
A PTAS for the minimization of polynomials of fixed degree over the simplex
- Computer Science, Mathematics
- Theor. Comput. Sci.
- 2006
- 93
- PDF
There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
- Mathematics, Computer Science
- Oper. Res.
- 1973
- 113
A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed
- Computer Science
- Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science
- 1993
- 197
- PDF
Effective lattice point counting in rational convex polytopes
- Mathematics, Computer Science
- J. Symb. Comput.
- 2004
- 262
- PDF
A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed
- Mathematics
- 1994
- 104
- Highly Influential