Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane

DOI10.1287/moor.2015.0738zbMath1338.90262arXiv1408.4711OpenAlexW1740954773WikidataQ57568084 ScholiaQ57568084MaRDI QIDQ2806816

Kevin Zemmer, Alberto Del Pia, Robert Hildebrand, Robert Weismantel

Publication date: 19 May 2016

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

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

zbMATH Keywords

nonlinear integer programmingpolynomial optimization

Mathematics Subject Classification ID

Integer programming (90C10) Nonlinear programming (90C30)

Related Items

Short Presburger Arithmetic Is Hard ⋮ Complexity of optimizing over the integers ⋮ A Polyhedral Frobenius Theorem with Applications to Integer Optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Computing real roots of real polynomials
• Mixed-integer quadratic programming is in NP
• Generalized convexity and optimization. Theory and applications
• On integer points in polyhedra
• Integer optimization on convex semialgebraic sets
• On the Complexity of Nonlinear Mixed-Integer Optimization
• On the Computational Complexity of Determining the Solvability or Unsolvability of the Equation X 2 - DY 2 = -1
• Production Sets with Indivisibilities, Part I: Generalities
• Production Sets with Indivisibilities, Part II: The Case of Two Activities
• Mirror-Descent Methods in Mixed-Integer Convex Optimization
• Integer Polynomial Optimization in Fixed Dimension
• On the Diophantine Equation mX 2 - nY 2 = ± 1