Samenvatting
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.
Originele taal-2 | Engels |
---|---|
Pagina's (van-tot) | 53-56 |
Tijdschrift | Operations Research Letters |
Volume | 39 |
Nummer van het tijdschrift | 1 |
DOI's | |
Status | Gepubliceerd - 2011 |