Global Optimization of Mixed-Integer Nonlinear Programs with SCIP 8

Authors Ksenia Bestuzheva, Antonia Chmiela, Benjamin Müller, Felipe Serrano, Stefan Vigerske, Fabian Wegscheider

Publication date 2 January 2023

Numerical mathematical programming methods (65K05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mixed integer programming (90C11) Quadratic programming (90C20) Nonconvex programming, global optimization (90C26)

Abstract: For over ten years, the constraint integer programming framework SCIP has been extended by capabilities for the solution of convex and nonconvex mixed-integer nonlinear programs (MINLPs). With the recently published version 8.0, these capabilities have been largely reworked and extended. This paper discusses the motivations for recent changes and provides an overview of features that are particular to MINLP solving in SCIP. Further, difficulties in benchmarking global MINLP solvers are discussed and a comparison with several state-of-the-art global MINLP solvers is provided.

This page was built for publication: Global Optimization of Mixed-Integer Nonlinear Programs with SCIP 8

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6422314)