MINLPLib
From MaRDI portal
Cited in
(only showing first 100 items - show all)- BARON
- GLOB
- MindtPy
- PaPILO
- SCIP
- LaGO
- GLOPTLAB
- CONOPT
- UG
- AMPL
- A hybrid LP/NLP paradigm for global optimization relaxations
- MIPLIB
- NLPQLP
- A reduced space branch and bound algorithm for a class of sum of ratios problems
- Couenne
- Cbc
- LINDO
- COIN-OR
- GLOBALLib
- filterSQP
- Bonmin
- MIDACO
- MINLP
- FEASPUMP
- Ipopt
- QP
- Lift-and-project cuts for convex mixed integer nonlinear programs
- XPRESS
- Domain reduction techniques for global NLP and MINLP optimization
- CppAD
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver
- Pyomo
- AIMMS
- Variable neighborhood search: basics and variants
- DICOPT
- AlphaECP
- GAMS
- LogMIP
- DFL
- Schittkowski
- RBFOpt: an open-source library for black-box optimization with costly function evaluations
- Computing feasible points for binary MINLPs with MPECs
- Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes
- Global optimization of nonconvex problems with convex-transformable intermediates
- Rounding-based heuristics for nonconvex MINLPS
- Lagrangian decomposition of block-separable mixed-integer all-quadratic programs
- Polyhedral approximation in mixed-integer convex optimization
- JBool
- DrAmpl
- LINDOGlobal
- FilMINT
- minlpBB
- SBB
- GloMIQO
- MISQP
- MINOTAUR
- DipPy
- SAS/OR
- FiberSCIP
- ParaSCIP
- libMC
- Lamatto
- MINLPB4
- MISQPOA
- MIQL
- MISQPN
- A storm of feasibility pumps for nonconvex MINLP
- Analyzing the computational impact of MIQCP solver components
- Convex envelopes generated from finitely many compact convex sets
- CQP
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
- AQUARS
- OSiL
- GLOPEQ
- ROSE
- CGLS
- A proximal-point outer approximation algorithm
- COIN-OR/GAMSLinks
- The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
- MacMINLP
- APOGEE
- BFOUR
- GEATbx
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- NOA
- Alternative regularizations for outer-approximation algorithms for convex MINLP
- Satin
- Review and comparison of algorithms and software for mixed-integer derivative-free optimization
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- On generalized surrogate duality in mixed-integer nonlinear programming
- ANTIGONE
- PAVER
- PyEvalGui
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- A disjunctive cut strengthening technique for convex MINLP
- On decomposition and multiobjective-based column and disjunctive cut generation for MINLP
- Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems
- Sequence of polyhedral relaxations for nonlinear univariate functions
- MProbe
This page was built for software: MINLPLib
