| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142585 | Operations Research Letters | 2011 | 4 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
J.C.M. Keijsper, R.A. Pendavingh,