PaPILO: A Parallel Presolving Library for Integer and Linear Optimization with Multiprecision Support

References

• Achterberg T, Wunderling R (2013) Mixed integer programming: Analyzing 12 years of progress. Jünger M, Reinelt G, eds. Facets of Combinatorial Optimization (Springer, Berlin, Heidelberg), 449–481.Crossref, Google Scholar
• Achterberg T, Bixby R, Gu Z, Rothberg E, Weninger D (2019) Presolve reductions in mixed integer programming. INFORMS J. Comput. 32(2):473–506.Link, Google Scholar
• Andersen E, Andersen K (1995) Presolving in linear programming. Math. Program. 71:221–245.Crossref, Google Scholar
• Applegate D, Díaz M, Hinder O, Lu H, Lubin M, O’Donoghue B, Schudy W (2021) Practical large-scale linear programming using primal-dual hybrid gradient. Preprint, submitted June 9, https://arxiv.org/abs/2106.04756.Google Scholar
• Bestuzheva K, Besançon M, Chen WK, Chmiela A, Donkiewicz T, van Doornmalen J, Eifler L, et al. (2021) The SCIP Optimization Suite 8.0. Preprint, submitted December 16, https://arxiv.org/abs/2112.08872.Google Scholar
• Brearley AL, Mitra G, Williams HP (1975) Analysis of mathematical programming problems prior to applying the simplex algorithm. Math. Program. 8:54–83.Crossref, Google Scholar
• Crowder H, Johnson EL, Padberg M (1983) Solving large-scale zero-one linear programming problems. Oper. Res. 31(5):803–834.Link, Google Scholar
• Eifler L, Gleixner A (2023) A computational status update for exact rational mixed integer programming. Math. Program. 197:793–812.Crossref, Google Scholar
• Gamrath G, Koch T, Martin A, Miltenberger M, Weninger D (2015) Progress in presolving for mixed integer programming. Math. Program. Comput. 7(4):367–398.Crossref, Google Scholar
• Gamrath G, Anderson D, Bestuzheva K, Chen WK, Eifler L, Gasse M, Gemander P, et al. (2020) The SCIP Optimization Suite 7.0. Preprint, submitted March 30, http://www.optimization-online.org/DB_HTML/2020/03/7705.html.Google Scholar
• Gemander P, Chen WK, Weninger D, Gottwald L, Gleixner A (2020) Two-row and two-column mixed-integer presolve using hashing-based pairing methods. EURO J. Comput. Optim. 8(3-4):205–240.Google Scholar
• Gleixner A, Gottwald L, Hoen A (2022) PaPILO: A parallel presolving library for integer and linear programming with multiprecision support. http://dx.doi.org/10.1287/ijoc.2022.0171.cd, https://github.com/INFORMSJoC/2022.0171.Google Scholar
• Gleixner A, Hendel G, Gamrath G, Achterberg T, Bastubbe M, Berthold T, Christophel PM, et al. (2021) MIPLIB 2017: Data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. 13:443–490.Crossref, Google Scholar
• Guignard M, Spielberg K (1981) Logical reduction methods in zero-one programming—Minimal preferred variables. Oper. Res. 29(1):49–74.Link, Google Scholar
• Hoffman KL, Padberg M (1991) Improving LP-representations of zero-one linear programs for branch-and-cut. ORSA J. Comput. 3(2):121–134.Link, Google Scholar
• Johnson EL, Suhl U (1980) Experiments in integer programming. Discrete Appl. Math. 2:39–55.Crossref, Google Scholar
• Savelsbergh M (1994) Preprocessing and probing techniques for mixed integer programming problems. ORSA J. Comput. 6(4):445–454.Link, Google Scholar
• Weninger D (2016) Solving mixed-integer programs arising in production planning. Unpublished doctoral thesis, Friedrich-Alexander-Universität Erlangen-Nürnberg.Google Scholar