SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework

DOI10.1080/10556788.2017.1335312zbMath1398.90112OpenAlexW2411933627MaRDI QIDQ4637831

Publication date: 3 May 2018

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2017.1335312

zbMATH Keywords

global optimization mixed integer nonlinear programming MINLP nonconvex constraints MIQCP mixed integer quadratically constrained programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Related Items

COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS, Minotaur: a mixed-integer nonlinear optimization toolkit, Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT, On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming, Bi-objective design-for-control of water distribution networks with global bounds, Pyomo.GDP: an ecosystem for logic based modeling and optimization development, Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations, The supporting hyperplane optimization toolkit for convex MINLP, On decomposability of multilinear sets, A computational study of global optimization solvers on two trust region subproblems, Team Orienteering with Time-Varying Profit, Tractable Relaxations of Composite Functions, Piecewise polyhedral formulations for a multilinear term, Optimality-based domain reduction for inequality-constrained NLP and MINLP problems, Realizability and inscribability for simplicial polytopes via nonlinear optimization, A low-cost alternating projection approach for a continuous formulation of convex and cardinality constrained optimization, Exact reliability optimization for series‐parallel graphs using convex envelopes, Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms, Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization, Graphical models for optimal power flow, An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver, FiberSCIP—A Shared Memory Parallelization of SCIP, A risk-averse stochastic program for integrated system design and preventive maintenance planning, Minimization of Akaike's information criterion in linear regression analysis via mixed integer nonlinear program, Linear models for stockpiling in open-pit mine production scheduling problems, On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation, Tighter McCormick relaxations through subgradient propagation, Experimental validation of volume-based comparison for double-McCormick relaxations, On the Performance of NLP Solvers Within Global MINLP Solvers, A system to evaluate gas network capacities: concepts and implementation, A decomposition approach for optimal gas network extension with a finite set of demand scenarios, Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns, QPLIB: a library of quadratic programming instances, A branch-and-cut algorithm for mixed-integer bilinear programming, Large-scale problems with quasi-block matrices, Algorithm 996, On tackling reverse convex constraints for non-overlapping of unequal circles, Linearization of McCormick relaxations and hybridization with the auxiliary variable method, Parallel global search algorithm with local tuning for solving mixed-integer global optimization problems, On the implementation and strengthening of intersection cuts for QCQPs, Branch-and-price for a class of nonconvex mixed-integer nonlinear programs, Mixed Integer Nonlinear Program for Minimization of Akaike’s Information Criterion, PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite, Conflict Analysis for MINLP, A choice-based optimization approach for contracting in supply chains, New SOCP relaxation and branching rule for bipartite bilinear programs, \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria, Optimization hierarchy for fair statistical decision problems, Linearization and parallelization schemes for convex mixed-integer nonlinear optimization, On generalized surrogate duality in mixed-integer nonlinear programming

Uses Software

Cites Work