In this paper, we present a review of deterministic software for solving convex MINLP
problems as well as a comprehensive comparison of a large selection of commonly …

This manuscript reviews recent advances in deterministic global optimization for Mixed-
Integer Nonlinear Programming (MINLP), as well as Constrained Derivative-Free …

Many optimal decision problems in scientific, engineering, and public sector applications
involve both discrete decisions and nonlinear system dynamics that affect the quality of the …

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 …

In the literature for mixed integer programming, heuristic algorithms (particularly primal
heuristics) are often considered as stand-alone procedures; in that context, heuristics are …

This article introduces rens, the relaxation enforced neighborhood search, a large
neighborhood search algorithm for mixed integer nonlinear programs (MINLPs). It uses a …

For over 10 years, the constraint integer programming framework SCIP has been extended
by capabilities for the solution of convex and nonconvex mixed-integer nonlinear programs …

This paper is concerned with optimal operation of pressurized water supply networks at a
fixed point in time. We use a mixed-integer nonlinear programming (MINLP) model …

The pq-relaxation for the pooling problem can be constructed by applying McCormick
envelopes for each of the bilinear terms appearing in the so-called pq-formulation of the …

This paper introduces a heuristic for mixed-integer mathematical programs, that can be seen
as a generalization of the relax-and-fix heuristic: a sequence of derived subproblems is …