Integer Polynomial Optimization in Fixed Dimension
From MaRDI portal
Publication:5387970
DOI10.1287/moor.1050.0169zbMath1278.90267arXivmath/0410111OpenAlexW2162500852WikidataQ56050222 ScholiaQ56050222MaRDI QIDQ5387970
Matthias Köppe, Raymond Hemmecke, Robert Weismantel, 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
computational complexityrational functionsapproximation algorithmsinteger nonlinear programmingFPTASinteger programming in fixed dimension
Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)
Related Items
Polyhedral omega: a new algorithm for solving linear Diophantine systems, A fixed point iterative approach to integer programming and its distributed computation, Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations, Short Presburger Arithmetic Is Hard, Scheduling for a processor sharing system with linear slowdown, Minimization of even conic functions on the two-dimensional integral lattice, A polynomial algorithm for minimizing discrete convic functions in fixed dimension, The power of pyramid decomposition in Normaliz, On the number of integer points in translated and expanded polyhedra, FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension, Norm bounds and underestimators for unconstrained polynomial integer minimization, Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra, A revised Taha's algorithm for polynomial 0-1 programming, When is rounding allowed in integer nonlinear optimization?, Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane, Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables, A Polyhedral Frobenius Theorem with Applications to Integer Optimization
Uses Software
