Let F(x) be a convex function defined in R^{n}), which is symmetric about the origin and homogeneous of degree 1, and let L be the lattice of integers Z^{n}. A definition of a reduced basis, b^{1},...,b^{n}, of the lattice with respect to the distance function F is presented, and we describe an algorithm which yields a reduced basis in polynomial time, for fixed n. In the special case in which the bodies {x : F(x) <= t} are ellipsoids, the definition of a reduced basis is identical with that given by Lenstra, Lenstra and Lovasz (1982) and the algorithm is the well known basis reduction algorithm. We show that the basis vector b^{1}, in a reduced basis, is an approximation to a shortest non-zero lattice point with respect to F and relate the basis vectors b^{i} to Minkowski's successive minima. The results lead to an algorithm for integer programming which executes in polynomial time for fixed n, but which avoids the ellipsoidal approximation required by Lenstra's algorithm. We also discuss the properties of a Korkine-Zolotarev basis for the lattice.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Length: 22 pages Date of creation: Jun 1990 Date of revision: Publication status: Published in Mathematics of Operations Research (August 1992), 17(3): 751-764 Handle: RePEc:cwl:cwldpp:946
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)