IDEAS home Printed from
   My bibliography  Save this paper

The Generalized Basis Reduction Algorithm




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)

Suggested Citation

  • Herbert E. Scarf & Laszlo Lovasz, 1990. "The Generalized Basis Reduction Algorithm," Cowles Foundation Discussion Papers 946, Cowles Foundation for Research in Economics, Yale University.
  • Handle: RePEc:cwl:cwldpp:946
    Note: CFP 818.

    Download full text from publisher

    File URL:
    Download Restriction: no

    Other versions of this item:


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.

    Cited by:

    1. William Cook & Thomas Rutherford & Herbert E. Scarf & David Shallcross, 1993. "An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 5(2), pages 206-212, May.
    2. Herbert Scarf, 1994. "The Allocation of Resources in the Presence of Indivisibilities," Journal of Economic Perspectives, American Economic Association, vol. 8(4), pages 111-128, Fall.
    3. Sanjay Mehrotra & Zhifeng Li, 2011. "Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices," Journal of Global Optimization, Springer, vol. 49(4), pages 623-649, April.


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:cwl:cwldpp:946. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Matthew Regan). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.