Convex integer minimization in fixed dimension

MaRDI QIDQ6231726zbMATH OpenFDO

Authors Timm Oertel, Christian Wagner, Robert Weismantel

Publication date 19 March 2012

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Integer programming (90C10) Mixed integer programming (90C11) Convex programming (90C25)

Abstract: We show that minimizing a convex function over the integer points of a bounded convex set is polynomial in fixed dimension.

This page was built for publication: Convex integer minimization in fixed dimension

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6231726)