MINLPLib

swMATH6172MaRDI QIDQ18306FDOQ18306

Author name not available (Why is that?)

Official website: http://www.minlplib.org/

Described by source

• MINLPLib -- a collection of test models for mixed-integer nonlinear programming

Cited In (only showing first 100 items - show all)

• Using projected cutting planes in the extended cutting plane method
• A computational study of primal heuristics inside an MI(NL)P solver
• Polyhedral approximation in mixed-integer convex optimization
• Lago: a (heuristic) branch and cut algorithm for nonconvex minlps
• Lagrangian decomposition of block-separable mixed-integer all-quadratic programs
• Solving convex MINLP optimization problems using a sequential cutting plane algorithm
• Lift-and-project cuts for convex mixed integer nonlinear programs
• Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts
• Convex relaxations for mixed-integer nonlinear programs
• Lift-and-project cuts for mixed integer convex programs
• Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 8th international conference, CPAIOR 2011, Berlin, Germany, May 23--27, 2011. Proceedings
• Integrality gap minimization heuristics for binary mixed integer nonlinear programming
• A branch-and-cut algorithm for mixed-integer bilinear programming
• Solving house allocation problems with risk-averse agents
• Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
• A storm of feasibility pumps for nonconvex MINLP
• Convex envelopes generated from finitely many compact convex sets
• The supporting hyperplane optimization toolkit for convex MINLP
• A dynamic convexized method for nonconvex mixed integer nonlinear programming
• Non polyhedral convex envelopes for 1-convex functions
• A disjunctive cut strengthening technique for convex MINLP
• Convex envelopes of products of convex and component-wise concave functions
• Extended formulations for convex envelopes
• SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
• A recipe for finding good solutions to MINLPs
• Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes
• A framework for globally optimizing mixed-integer signomial programs
• SO-MI: a surrogate model algorithm for computationally expensive nonlinear mixed-integer black-box global optimization problems
• Penalty alternating direction methods for mixed-integer optimization: a new view on feasibility pumps
• Global optimization of general non-convex problems with intermediate bilinear substructures
• Reformulations in mathematical programming: automatic symmetry detection and exploitation
• Juniper
• Convex.jl
• RBFOpt
• QPLIB
• BBCPOP
• extended-MIQCP
• lifting
• IPET
• Decogo
• Muriqui
• SUSPECT
• Pajarito
• POLIP
• RENS. The optimal rounding
• Market neutral portfolios
• CapoOne
• DFLGEN
• DFLBOX
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• Exact and fast algorithms for mixed-integer nonlinear programming
• A hybrid LP/NLP paradigm for global optimization relaxations
• Strong-branching inequalities for convex mixed integer nonlinear programs
• Stabilizer-based symmetry breaking constraints for mathematical programs
• Three ideas for a feasibility pump for nonconvex MINLP
• Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
• SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
• A benchmark library of mixed-integer optimal control problems
• MindtPy
• PaPILO
• Title not available (Why is that?)
• Rounding-based heuristics for nonconvex MINLPS
• The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
• Outer approximation with conic certificates for mixed-integer convex problems
• Learning and propagating Lagrangian variable bounds for mixed-integer nonlinear programming
• Global optimization of mixed-integer models with quadratic and signomial functions: a review
• A mixed-discrete particle swarm optimization algorithm with explicit diversity-preservation
• Global optimization algorithm for mixed integer quadratically constrained quadratic program
• Alpine
• Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
• Three enhancements for optimization-based bound tightening
• A note on solving MINLP's using formulation space search
• Undercover: a primal MINLP heuristic exploring a largest sub-MIP
• PAVER 2.0: an open source environment for automated performance analysis of benchmarking data
• SUSPECT: MINLP special structure detector for Pyomo
• QPLIB: a library of quadratic programming instances
• Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
• A numerical study of MIDACO on 100 MINLP benchmarks
• Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
• GLOB
• FiberSCIP—A Shared Memory Parallelization of SCIP
• SCIP
• AMPL
• Couenne
• Cbc
• LINDO
• COIN-OR
• GLOBALLib
• filterSQP
• Bonmin
• FEASPUMP
• MIDACO
• Ipopt
• CppAD
• MINLP
• AIMMS
• AlphaECP
• QP
• DICOPT

This page was built for software: MINLPLib