
SCIP
 Referenced in 472 articles
[sw01091]
 programming (MIP) and mixed integer nonlinear programming (MINLP). It is also a framework for constraint...

KNITRO
 Referenced in 179 articles
[sw00490]
 MIPs), particular convex mixed integer, nonlinear problems (MINLP). KNITRO is highly regarded for its robustness...

Couenne
 Referenced in 63 articles
[sw04347]
 bounds tightening techniques for nonconnvex MINLP. Many industrial problems can be naturally formulated using ... mixed integer nonlinear programming (MINLP) models and can be solved by spatial Branch& Bound ... developed for MILP, reliability branching, to the MINLP case. Motivated by the demand for open ... source solvers for realworld MINLP problems, we have developed an sBB software package named...

MINLP
 Referenced in 49 articles
[sw04800]
 MINLP World is a forum for discussion and dissemination of information about all aspects ... Mixed Integer Nonlinear Programming (MINLP): http://www.gamsworld.org/minlp/solvers.htm...

FilMINT
 Referenced in 44 articles
[sw06197]
 solver for convex mixedinteger nonlinear programs (MINLPs) that implements a linearizationbased algorithm ... based branchandbound algorithm for convex MINLP optimization problems.” Comput. Chemical Engrg ... other wellknown MILP enhancements for MINLPs. We present detailed computational experiments that show ... efficient on a wide range of MINLPs. By carefully incorporating and tuning all these enhancements...

AlphaECP
 Referenced in 45 articles
[sw04940]
 GAMS/AlphaECP is a MINLP (MixedInteger NonLinear Programming) solver based on the extended cutting ... solver can be applied to general MINLP problems and global optimal solutions can be ensured ... pseudoconvex MINLP problems. The ECP method is an extension of Kelley’s cutting plane...

DICOPT
 Referenced in 35 articles
[sw04938]
 program for solving mixedinteger nonlinear programming (MINLP) problems that involve linear binary or integer ... While the modeling and solution of these MINLP optimization problems has not yet reached ... algorithm for the equality relaxation strategy. The MINLP algorithm inside DICOPT solves a series...

LaGO
 Referenced in 25 articles
[sw02040]
 LaGO (Lagrangian Global Optimizer) is a MINLP solver developed in the DFGproject ”Optimization ... solver for blockseparable not necessarily convex MINLPs. This algorithm is illustrated in the recent ... heuristic) Branch and Cut algorithm for nonconvex MINLPs” and in the slides of the talk ... Branch and Cut for nonconvex blockseparable MINLPs in the absence of algebraic formulations...

UG
 Referenced in 23 articles
[sw03500]
 branchandbound based solvers (e.g., MIP, MINLP, ExactIP) in a distributed or shared memory...

SBB
 Referenced in 17 articles
[sw06250]
 GAMS solver for Mixed Integer Nonlinear Programming (MINLP) models. It is based on a combination...

SHOT
 Referenced in 9 articles
[sw15630]
 solving convex mixedinteger nonlinear programming (MINLP) problems is presented in this paper: The extended ... tight linear relaxation of the original MINLP problem. After an initial overestimated set has been ... converges to a global optimum for convex MINLP problems. The ESH algorithm is implemented ... performance against other stateoftheart MINLP solvers is presented...

CMUIBM
 Referenced in 12 articles
[sw13495]
 software for solving mixedinteger nonlinear programs (MINLP) with convex relaxation. The main objectives...

FiberSCIP
 Referenced in 8 articles
[sw06291]
 MIPs) and mixedinteger nonlinear programs (MINLPs) in parallel is demonstrated...

MEIGO
 Referenced in 6 articles
[sw08492]
 nonlinear programming (cNLP) and mixedinteger programming (MINLP) problems, and variable neighborhood search...

MAiNGO
 Referenced in 4 articles
[sw27878]
 optimization software for solving mixedintegernonlinear programs (MINLP). It is applicable to a wide range ... MINLPs and has been shownto have computational advantages for classes of problems that admit reduced...

Decogo
 Referenced in 3 articles
[sw32747]
 approximation method for general modular and/or sparse MINLPs. The new method, called decompositionbased inner ... successively refined by solving many easier MINLP and MIP subproblems in parallel (using BB), instead ... based global optimizer), a new parallel decomposition MINLP solver implemented in Python and Pyomo...

APMonitor
 Referenced in 5 articles
[sw19694]
 mixed integer programming (LP, QP, NLP, MILP, MINLP). Modes of operation include data reconciliation, real...

MIDACO
 Referenced in 4 articles
[sw04775]
 continuous (NLP), discrete/integer (IP) and mixed integer (MINLP) problems. Problems may be restricted to equality...

Juniper
 Referenced in 2 articles
[sw26689]
 Julia. Nonconvex mixedinteger nonlinear programs (MINLPs) represent a challenging class of optimization problems that ... highquality solutions to largescale nonconvex MINLPs, such as those arising in infrastructure network ... bound algorithms as heuristics for nonconvex MINLPs...

GGPECP
 Referenced in 3 articles
[sw08450]
 GGPECP–An algorithm for solving nonconvex MINLP problems by cutting plane and transformation techniques...