IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v48y2023i4p2267-2286.html

Polynomial Upper Bounds on the Number of Differing Columns of Δ-Modular Integer Programs

Author

Listed:
  • Jon Lee

    (Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan 48109)

  • Joseph Paat

    (Sauder School of Business, University of British Columbia, Vancouver, British Columbia V6T 1Z2, Canada)

  • Ingo Stallknecht

    (Department of Mathematics, Eidgenossische Technische Hochschule Zurich, 8092 Zurich, Switzerland)

  • Luze Xu

    (Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan 48109)

Abstract

We study integer-valued matrices with bounded determinants. Such matrices appear in the theory of integer programs (IPs) with bounded determinants. For example, an IP can be solved in strongly polynomial time if the constraint matrix is bimodular: that is, the determinants are bounded in absolute value by two. Determinants are also used to bound the ℓ 1 distance between IP solutions and solutions of its linear relaxation. One of the first to quantify the complexity of IPs with bounded determinants was Heller, who identified the maximum number of differing columns in a totally unimodular matrix. Each extension of Heller’s bound to general determinants has been superpolynomial in the determinants or the number of equations. We provide the first column bound that is polynomial in both values. For integer programs with box constraints, our result gives the first ℓ 1 distance bound that is polynomial in the determinants and the number of equations. Our result can also be used to derive a bound on the height of Graver basis elements that is polynomial in the determinants and the number of equations. Furthermore, we show a tight bound on the number of differing columns in a bimodular matrix; this is the first tight bound since Heller. Our analysis reveals combinatorial properties of bimodular IPs that may be of independent interest.

Suggested Citation

  • Jon Lee & Joseph Paat & Ingo Stallknecht & Luze Xu, 2023. "Polynomial Upper Bounds on the Number of Differing Columns of Δ-Modular Integer Programs," Mathematics of Operations Research, INFORMS, vol. 48(4), pages 2267-2286, November.
    • Handle: RePEc:inm:ormoor:v:48:y:2023:i:4:p:2267-2286
    DOI: 10.1287/moor.2022.1339
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. H. W. Lenstra, 1983. "Integer Programming with a Fixed Number of Variables," Mathematics of Operations Research, INFORMS, vol. 8(4), pages 538-548, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. M. Köppe & M. Queyranne & C. T. Ryan, 2010. "Parametric Integer Programming Algorithm for Bilevel Mixed Integer Programs," Journal of Optimization Theory and Applications, Springer, vol. 146(1), pages 137-150, July.
    2. K. Aardal & R. E. Bixby & C. A. J. Hurkens & A. K. Lenstra & J. W. Smeltink, 2000. "Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 192-202, August.
    3. Klaus Jansen & Lars Rohwedder, 2023. "On Integer Programming, Discrepancy, and Convolution," Mathematics of Operations Research, INFORMS, vol. 48(3), pages 1481-1495, August.
    4. Alberto Del Pia & Robert Hildebrand & Robert Weismantel & Kevin Zemmer, 2016. "Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 511-530, May.
    5. Eugene Lim & Tzeh Yuan Neoh & Nicholas Teh, 2025. "Fairness in Repeated Matching: A Maximin Perspective," Papers 2510.04624, arXiv.org.
    6. Klaus Jansen & Roberto Solis-Oba, 2011. "A Polynomial Time OPT + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths," Mathematics of Operations Research, INFORMS, vol. 36(4), pages 743-753, November.
    7. Friedrich Eisenbrand & Gennady Shmonin, 2008. "Parametric Integer Programming in Fixed Dimension," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 839-850, November.
    8. Jaykrishnan, G. & Levin, Asaf, 2024. "Scheduling with cardinality dependent unavailability periods," European Journal of Operational Research, Elsevier, vol. 316(2), pages 443-458.
    9. Masing, Berenike & Lindner, Niels & Borndörfer, Ralf, 2022. "The price of symmetric line plans in the Parametric City," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 419-443.
    10. Sanchari Deb & Kari Tammi & Karuna Kalita & Pinakeswar Mahanta, 2018. "Review of recent trends in charging infrastructure planning for electric vehicles," Wiley Interdisciplinary Reviews: Energy and Environment, Wiley Blackwell, vol. 7(6), November.
    11. Kenneth J. Arrow & Timothy J. Kehoe, 1994. "Distinguished Fellow: Herbert Scarf's Contributions to Economics," Journal of Economic Perspectives, American Economic Association, vol. 8(4), pages 161-181, Fall.
    12. Marcel Celaya & Stefan Kuhlmann & Joseph Paat & Robert Weismantel, 2024. "Proximity and Flatness Bounds for Linear Integer Optimization," Mathematics of Operations Research, INFORMS, vol. 49(4), pages 2446-2467, November.
    13. Kubale, Marek, 1996. "Preemptive versus nonpreemptive scheduling of biprocessor tasks on dedicated processors," European Journal of Operational Research, Elsevier, vol. 94(2), pages 242-251, October.
    14. Ou, Jinwen & Li, Weidong, 2026. "Scheduling mixed batch machines with inclusive processing set restrictions and non-identical capacities," European Journal of Operational Research, Elsevier, vol. 328(2), pages 407-414.
    15. Matthias Bentert & Robert Bredereck & Péter Györgyi & Andrzej Kaczmarczyk & Rolf Niedermeier, 2023. "A multivariate complexity analysis of the material consumption scheduling problem," Journal of Scheduling, Springer, vol. 26(4), pages 369-382, August.
    16. Danny Nguyen & Igor Pak, 2020. "The Computational Complexity of Integer Programming with Alternations," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 191-204, February.
    17. William Cook & Thomas Rutherford & Herbert E. Scarf & David F. Shallcross, 1991. "An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming," Cowles Foundation Discussion Papers 990, Cowles Foundation for Research in Economics, Yale University.
    18. Egor Ianovski, 2022. "Electing a committee with dominance constraints," Annals of Operations Research, Springer, vol. 318(2), pages 985-1000, November.
    19. Sascha Kurz & Nikolas Tautenhahn, 2013. "On Dedekind’s problem for complete simple games," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(2), pages 411-437, May.
    20. Alberto Caprara & Andrea Lodi & Michele Monaci, 2005. "Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing," Mathematics of Operations Research, INFORMS, vol. 30(1), pages 150-172, February.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    JEL classification:

    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:inm:ormoor:v:48:y:2023:i:4:p:2267-2286. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.