IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v35y2018i4d10.1007_s10878-018-0264-z.html
   My bibliography  Save this article

FPT-algorithms for some problems related to integer programming

Author

Listed:
  • D. V. Gribanov

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

  • D. S. Malyshev

    (National Research University Higher School of Economics)

  • P. M. Pardalos

    (National Research University Higher School of Economics
    University of Florida)

  • S. I. Veselov

    (Lobachevsky State University of Nizhny Novgorod)

Abstract

In this paper, we present fixed-parameter tractable algorithms for special cases of the shortest lattice vector, integer linear programming, and simplex width computation problems, when matrices included in the problems’ formulations are near square. The parameter is the maximum absolute value of the rank minors in the corresponding matrices. Additionally, we present fixed-parameter tractable algorithms with respect to the same parameter for the problems, when the matrices have no singular rank submatrices.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jcomop:v:35:y:2018:i:4:d:10.1007_s10878-018-0264-z
    DOI: 10.1007/s10878-018-0264-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-018-0264-z
    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/s10878-018-0264-z?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. Ravi Kannan, 1987. "Minkowski's Convex Body Theorem and Integer Programming," Mathematics of Operations Research, INFORMS, vol. 12(3), pages 415-440, August.
    2. H. W. Lenstra, 1983. "Integer Programming with a Fixed Number of Variables," Mathematics of Operations Research, INFORMS, vol. 8(4), pages 538-548, November.
    3. Éva Tardos, 1986. "A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs," Operations Research, INFORMS, vol. 34(2), pages 250-256, April.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

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

    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. Li, Weidong & Ou, Jinwen, 2024. "Machine scheduling with restricted rejection: An Application to task offloading in cloud–edge collaborative computing," European Journal of Operational Research, Elsevier, vol. 314(3), pages 912-919.
    2. Niclas Boehmer & Edith Elkind, 2020. "Stable Roommate Problem with Diversity Preferences," Papers 2004.14640, arXiv.org.
    3. Klaus Jansen & Kim-Manuel Klein & José Verschae, 2020. "Closing the Gap for Makespan Scheduling via Sparsification Techniques," Mathematics of Operations Research, INFORMS, vol. 45(4), pages 1371-1392, November.
    4. 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.
    5. 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.
    6. 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.
    7. A. Yu. Chirkov & D. V. Gribanov & D. S. Malyshev & P. M. Pardalos & S. I. Veselov & N. Yu. Zolotykh, 2019. "On the complexity of quasiconvex integer minimization problem," Journal of Global Optimization, Springer, vol. 73(4), pages 761-788, April.
    8. Phablo F. S. Moura & Matheus J. Ota & Yoshiko Wakabayashi, 2023. "Balanced connected partitions of graphs: approximation, parameterization and lower bounds," Journal of Combinatorial Optimization, Springer, vol. 45(5), pages 1-27, July.
    9. 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.
    10. 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.
    11. Ting Pong & Hao Sun & Ningchuan Wang & Henry Wolkowicz, 2016. "Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem," Computational Optimization and Applications, Springer, vol. 63(2), pages 333-364, March.
    12. Amitai Armon & Iftah Gamzu & Danny Segev, 2014. "Mobile facility location: combinatorial filtering via weighted occupancy," Journal of Combinatorial Optimization, Springer, vol. 28(2), pages 358-375, August.
    13. Friedrich Eisenbrand & Gennady Shmonin, 2008. "Parametric Integer Programming in Fixed Dimension," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 839-850, November.
    14. 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.
    15. Chen, Lin & Ye, Deshi & Zhang, Guochuan, 2018. "Parallel machine scheduling with speed-up resources," European Journal of Operational Research, Elsevier, vol. 268(1), pages 101-112.
    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. László A. Végh, 2017. "A Strongly Polynomial Algorithm for Generalized Flow Maximization," Mathematics of Operations Research, INFORMS, vol. 42(1), pages 179-211, January.
    18. Mao-Cheng Cai & Xiaoguang Yang & Yanjun Li, 1999. "Inverse Polymatroidal Flow Problem," Journal of Combinatorial Optimization, Springer, vol. 3(1), pages 115-126, July.
    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. Elizabeth Baldwin & Paul Klemperer, 2019. "Understanding Preferences: “Demand Types”, and the Existence of Equilibrium With Indivisibilities," Econometrica, Econometric Society, vol. 87(3), pages 867-932, May.

    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:jcomop:v:35:y:2018:i:4:d:10.1007_s10878-018-0264-z. 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.