SCIP: Global Optimization of Mixed-Integer Nonlinear Programs in a Branch-and-Cut Framework

accepted for publication
  • This paper describes the extensions that were added to the constraint integer programming framework SCIP in order to enable it to solve convex and nonconvex mixed-integer nonlinear programs (MINLPs) to global optimality. SCIP implements a spatial branch-and-bound algorithm based on a linear outer-approximation, which is computed by convex over- and underestimation of nonconvex functions. An expression graph representation of nonlinear constraints allows for bound tightening, structure analysis, and reformulation. Primal heuristics are employed throughout the solving process to find feasible solutions early. We provide insights into the performance impact of individual MINLP solver components via a detailed computational study over a large and heterogeneous test set.

Export metadata

  • Export Bibtex

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Stefan Vigerske, Ambros Gleixner
Document Type:Article
Parent Title (English):Optimization Methods & Software
Year of first publication:2017
Preprint:urn:nbn:de:0297-zib-59377

$Rev: 13581 $