IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v108y2001i1p87-10910.1023-a1016050826491.html
   My bibliography  Save this article

Minimised Geometric Buchberger Algorithm for Integer Programming

Author

Listed:
  • Qiang Li
  • Yi-ke Guo
  • John Darlington
  • Tetsuo Ida

Abstract

Recently, various algebraic integer programming (IP) solvers have been proposed based on the theory of Gröbner bases. The main difficulty of these solvers is the size of the Gröbner bases generated. In algorithms proposed so far, large Gröbner bases are generated by either introducing additional variables or by considering the generic IP problem IP A,C . Some improvements have been proposed such as Hosten and Sturmfels' method (GRIN) designed to avoid additional variables and Thomas' truncated Gröbner basis method which computes the reduced Gröbner basis for a specific IP problem IP A,C (b) (rather than its generalisation IP A,C ). In this paper we propose a new algebraic algorithm for solving IP problems. The new algorithm, called Minimised Geometric Buchberger Algorithm, combines Hosten and Sturmfels' GRIN and Thomas' truncated Gröbner basis method to compute the fundamental segments of an IP problem IP A,C directly in its original space and also the truncated Gröbner basis for a specific IP problem IP A,C (b). We have carried out experiments to compare this algorithm with others such as the geometric Buchberger algorithm, the truncated geometric Buchberger algorithm and the algorithm in GRIN. These experiments show that the new algorithm offers significant performance improvement. Copyright Kluwer Academic Publishers 2001

Suggested Citation

  • Qiang Li & Yi-ke Guo & John Darlington & Tetsuo Ida, 2001. "Minimised Geometric Buchberger Algorithm for Integer Programming," Annals of Operations Research, Springer, vol. 108(1), pages 87-109, November.
  • Handle: RePEc:spr:annopr:v:108:y:2001:i:1:p:87-109:10.1023/a:1016050826491
    DOI: 10.1023/A:1016050826491
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1016050826491
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1023/A:1016050826491?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    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:spr:annopr:v:108:y:2001:i:1:p:87-109:10.1023/a:1016050826491. See general information about how to correct material in RePEc.

    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 bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.