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}
}
  • J. D. Loera, R. Hemmecke, +1 author R. Weismantel
  • Published 2006
  • Mathematics, Computer Science
  • Math. Oper. Res.
  • 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
    61 Citations
    FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
    • 21
    • PDF
    Integer quadratic programming in the plane
    • 17
    • PDF
    FPTAS for mixed-integer polynomial optimization with a fixed number of variables
    • 10
    • PDF
    Norm bounds and underestimators for unconstrained polynomial integer minimization
    • 4
    • PDF
    When is rounding allowed ? A new approach to integer nonlinear optimization
    • 3
    • PDF
    When is rounding allowed in integer nonlinear optimization?
    • 17
    Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane
    • 8
    • PDF
    Integer Convex Minimization in Low Dimensions
    • 4
    • PDF

    References

    SHOWING 1-10 OF 24 REFERENCES
    Integer Optimization on Convex Semialgebraic Sets
    • 61
    • PDF
    Minimizing Polynomial Functions
    • P. Parrilo, B. Sturmfels
    • 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
    • H. Lenstra
    • Mathematics, Computer Science
    • Math. Oper. Res.
    • 1983
    • 1,310
    • PDF
    Computing the Ehrhart quasi-polynomial of a rational simplex
    • A. Barvinok
    • Mathematics, Computer Science
    • Math. Comput.
    • 2006
    • 63
    • Highly Influential
    • PDF
    Global Optimization with Polynomials and the Problem of Moments
    • J. Lasserre
    • Mathematics, Computer Science
    • SIAM J. Optim.
    • 2001
    • 2,180
    • PDF
    A PTAS for the minimization of polynomials of fixed degree over the simplex
    • 93
    • PDF
    There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
    • 113
    A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed
    • A. Barvinok
    • Computer Science
    • Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science
    • 1993
    • 197
    • PDF
    Effective lattice point counting in rational convex polytopes
    • 262
    • PDF
    A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed
    • 104
    • Highly Influential