Convex minimization over Z^2

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

We present an algorithm for minimizing a convex function over all integer vectors in the plane. This problem generalizes both the nearest lattice vector problem and the integer programming problem in the plane.
Original languageEnglish
Pages (from-to)53-56
JournalOperations Research Letters
Volume39
Issue number1
DOIs
Publication statusPublished - 2011

Fingerprint Dive into the research topics of 'Convex minimization over Z^2'. Together they form a unique fingerprint.

  • Cite this