학술논문

Global Optimization of Mixed-Integer Nonlinear Programs with SCIP 8
Document Type
Working Paper
Source
Subject
Mathematics - Optimization and Control
65K05 (Primary) 90-08, 90C11, 90C20, 90C26 (Secondary)
G.1.6
G.4
Language
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.
Comment: 62 pages, shortened version submitted to Mathematical Programming Series B (Special Issue on Global Optimization)