IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v5y2024i2d10.1007_s43069-024-00310-2.html
   My bibliography  Save this article

On a Simple Connection Between $$\Delta$$ Δ -Modular ILP and LP, and a New Bound on the Number of Integer Vertices

Author

Listed:
  • Dmitry Gribanov

    (National Research University Higher School of Economics
    Lobachevsky State University of Nizhny Novgorod)

  • Dmitry Malyshev

    (National Research University Higher School of Economics
    Huawei)

  • Ivan Shumilov

    (Lobachevsky State University of Nizhny Novgorod)

Abstract

In our note, we present a very simple and short proof of a new interesting fact about the faces of an integer hull of a given rational polyhedron. This fact has a complete analog in linear programming theory and can be useful to establish new constructive upper bounds on the number of vertices in an integer hull of a $$\Delta$$ Δ -modular polyhedron, which are competitive for small values of $$\Delta$$ Δ and can be useful for integer linear maximization problems with a convex or quasiconvex objective function. As an additional corollary, we show that the number of vertices in an integer hull is bounded by $$O(n)^n$$ O ( n ) n for $$\Delta = O(1)$$ Δ = O ( 1 ) . As a part of our method, we introduce the notion of deep bases of a linear program. The problem to estimate their number by a non-trivial way seems to be quite challenging.

Suggested Citation

  • Dmitry Gribanov & Dmitry Malyshev & Ivan Shumilov, 2024. "On a Simple Connection Between $$\Delta$$ Δ -Modular ILP and LP, and a New Bound on the Number of Integer Vertices," SN Operations Research Forum, Springer, vol. 5(2), pages 1-9, June.
    • Handle: RePEc:spr:snopef:v:5:y:2024:i:2:d:10.1007_s43069-024-00310-2
    DOI: 10.1007/s43069-024-00310-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-024-00310-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s43069-024-00310-2?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.

    References listed on IDEAS

    as
    1. D. V. Gribanov & D. S. Malyshev & P. M. Pardalos & S. I. Veselov, 2018. "FPT-algorithms for some problems related to integer programming," Journal of Combinatorial Optimization, Springer, vol. 35(4), pages 1128-1146, May.
    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.

      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:snopef:v:5:y:2024:i:2:d:10.1007_s43069-024-00310-2. 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: 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.