A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX

References

• Adams WP, Forrester RJ, Glover FW (2004) Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs. Discrete Optim. 1(2):99–120.Crossref, Google Scholar
• Barahona F (1986) A solvable case of quadratic 0–1 programming. Discrete Appl. Math. 13(1):23–26.Crossref, Google Scholar
• Bengio Y, Lodi A, Prouvost A (2021) Machine learning for combinatorial optimization: A methodological tour d’horizon. Eur. J. Oper. Res. 290(2): 405–421.Google Scholar
• Billionnet A, Elloumi S, Lambert A (2012) Extending the qcr method to general mixed-integer programs. Math. Programming 131(1-2):381–401.Crossref, Google Scholar
• Bishop CM (2006) Pattern Recognition and Machine Learning. Information Science and Statistics (Springer-Verlag, New York).Google Scholar
• Bliek C, Bonami P, Lodi A (2014) Solving mixed-integer quadratic programming problems with IBM-CPLEX: A progress report. Proc. 26th RAMP Sympos. (RAMP, Tokyo), 171–180.Google Scholar
• Bonami P, Lodi A, Zarpellon G (2018) Learning a classification of mixed-integer quadratic programming problems. van Hoeve WJ, ed. Integration of Constraint Programming, Artificial Intelligence, and Operations Research (Springer International Publishing, Cham, Switzerland), 595–604.Crossref, Google Scholar
• Breiman L (2001) Random forests. Machine Learn. 45(1):5–32.Crossref, Google Scholar
• Cortes C, Vapnik V (1995) Support-vector networks. Machine Learn. 20(3):273–297.Crossref, Google Scholar
• CPLEX (2020). Accessed March 9, 2022, https://www.ibm.com/analytics/cplex-optimizer.Google Scholar
• Czyzyk J, Mesnier MP, Moré JJ (1998) The NEOS server. IEEE J. Comput. Sci. Engrg. 5(3):68–75.Crossref, Google Scholar
• Dolan ED (2001) The NEOS server 4.0 administrative guide. Technical Memorandum ANL/MCS-TM-250, Mathematics and Computer Science Division, Argonne National Laboratory, Lemont, IllinoisGoogle Scholar
• Fourer R (2015) Quadratic optimization mysteries, part 1: Two versions. Accessed March 9, 2022, http://bob4er.blogspot.ca/2015/03/quadratic-optimization-mysteries-part-1.html.Google Scholar
• Furini F, Traversi E, Belotti P, Frangioni A, Gleixner A, Gould N, Liberti L, et al.. (2018) QPLIB: A library of quadratic programming instances. Math. Programming Comput. 11, 237–265. https://doi.org/10.1007/s12532-018-0147-4.Google Scholar
• Gropp W, Moré JJ (1997) Optimization environments and the NEOS server. Buhman MD, Iserles A, eds. Approximation Theory and Optimization (Cambridge University Press), 167–182.Google Scholar
• Hutter F, Xu L, Hoos HH, Leyton-Brown K (2014) Algorithm runtime prediction: Methods & evaluation. Artificial Intelligence 206:79–111.Crossref, Google Scholar
• Khalil E, Le Bodic P, Song L, Nemhauser G, Dilkina B (2016) Learning to branch in mixed integer programming. Proc. 30th AAAI Conf. on Artificial Intelligence (AAAI Press, Palo Alto, CA), 30(1):724–731. https://ojs.aaai.org/index.php/AAAI/article/view/10080.Google Scholar
• Koch T, Achterberg T, Andersen E, Bastert O, Berthold T, Bixby RE, Danna E, et al. (2011) MIPLIB 2010. Math. Programming Comput. 3(2):103.Crossref, Google Scholar
• Lodi A (2009) Mixed integer programming computation. Jünger M, Liebling T, Naddef D, Nemhauser G, Pulleyblank W, Reinelt G, Rinaldi G, Wolsey L, eds. 50 Years of Integer Programming 1958-2008 (Springer, Berlin), 619–645.Google Scholar
• Lodi A, Tramontani A (2014) Performance variability in mixed-integer programming. Theory Driven by Influential Applications, 1–12. INFORMS TutORials in Operations Research, https://pubsonline.informs.org/doi/abs/10.1287/educ.2013.0112.Google Scholar
• Louppe G (2014) Understanding random forests: From theory to practice. PhD thesis, Université de Liège, Liège, Belgium.Google Scholar
• McCormick GP (1976) Computability of global solutions to factorable nonconvex programs: Part I—convex underestimating problems. Math. Programming 10(1):147–175.Crossref, Google Scholar
• MINOA (2021) Open-source benchmark library. Accessed March 9, 2022, https://minoa-itn.fau.de/?page_id=749.Google Scholar
• Motzkin TS, Straus EG (1965) Maxima for graphs and a new proof of a theorem of Turán. Canadian J. Math. 17:533–540.Crossref, Google Scholar
• Pedregosa F, Varoquaux G, Gramfort A, Michel V, Thirion B, Grisel O, Blondel M, et al.. (2011) Scikit-learn: Machine learning in Python. J. Machine Learn. Res. 12:2825–2830.Google Scholar