Integer Polynomial Optimization in Fixed Dimension

DOI10.1287/moor.1050.0169zbMath1278.90267arXivmath/0410111WikidataQ56050222 ScholiaQ56050222MaRDI QIDQ5387970

Robert Weismantel, Raymond Hemmecke, Matthias Köppe, Jesús A. De Loera

Publication date: 27 May 2008

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0410111

zbMATH Keywords

computational complexity; rational functions; approximation algorithms; integer nonlinear programming; FPTAS; integer programming in fixed dimension

Mathematics Subject Classification ID

90C10: Integer programming

90C60: Abstract computational complexity for mathematical programming problems

Related Items

A revised Taha's algorithm for polynomial 0-1 programming, A Polyhedral Frobenius Theorem with Applications to Integer Optimization, A fixed point iterative approach to integer programming and its distributed computation, Norm bounds and underestimators for unconstrained polynomial integer minimization, Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra, The power of pyramid decomposition in Normaliz, FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension, Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations, Polyhedral omega: a new algorithm for solving linear Diophantine systems, Scheduling for a processor sharing system with linear slowdown, When is rounding allowed in integer nonlinear optimization?, Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane

Uses Software

• LattE