IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v48y2023i3p1481-1495.html
   My bibliography  Save this article

On Integer Programming, Discrepancy, and Convolution

Author

Listed:
  • Klaus Jansen

    (University of Kiel, 24118 Kiel, Germany)

  • Lars Rohwedder

    (Maastricht University, 6211 LK Maastricht, Netherlands)

Abstract

Integer programs with a fixed number of constraints are solvable in pseudo-polynomial time in the largest coefficient of any constraint. We give a new algorithm which improves the running time of the state of the art. Moreover, we show that improving on our algorithm for any number of constraints is equivalent to improving over the quadratic time algorithm for (min, +)-convolution. This is strong evidence that our algorithm’s running time is the best possible. We also present a specialized algorithm for testing the feasibility of an integer program and give a tight lower bound, which is based on the strong exponential time hypothesis in this case.

Suggested Citation

  • Klaus Jansen & Lars Rohwedder, 2023. "On Integer Programming, Discrepancy, and Convolution," Mathematics of Operations Research, INFORMS, vol. 48(3), pages 1481-1495, August.
    • Handle: RePEc:inm:ormoor:v:48:y:2023:i:3:p:1481-1495
    DOI: 10.1287/moor.2022.1308
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2022.1308
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2022.1308?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
    ---><---

    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:inm:ormoor:v:48:y:2023:i:3:p:1481-1495. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.