MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
From MaRDI portal
Publication:2884552
DOI10.1287/ijoc.15.1.114.15159zbMath1238.90104OpenAlexW2155258508MaRDI QIDQ2884552
Alexander Meeraus, Arne Stolbjerg Drud, Michael R. Bussieck
Publication date: 30 May 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.15.1.114.15159
Mixed integer programming (90C11) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
Three ideas for a feasibility pump for nonconvex MINLP, Minotaur: a mixed-integer nonlinear optimization toolkit, A hybrid LP/NLP paradigm for global optimization relaxations, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, Disjunctive Cuts for Nonconvex MINLP, Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming, Solving house allocation problems with risk-averse agents, Non polyhedral convex envelopes for 1-convex functions, Sequence of polyhedral relaxations for nonlinear univariate functions, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, GLOMIQO: global mixed-integer quadratic optimizer, MathOptInterface: A Data Structure for Mathematical Optimization Problems, A mixed-discrete particle swarm optimization algorithm with explicit diversity-preservation, A recipe for finding good solutions to MINLPs, A storm of feasibility pumps for nonconvex MINLP, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, Optimality-based domain reduction for inequality-constrained NLP and MINLP problems, A framework for globally optimizing mixed-integer signomial programs, Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps, A computational study of perspective cuts, Efficient separation of RLT cuts for implicit and explicit bilinear products, Convex envelopes generated from finitely many compact convex sets, Mitigating anomalies in parallel branch-and-bound based algorithms for mixed-integer nonlinear optimization, Lift-and-project cuts for convex mixed integer nonlinear programs, Computational advances in polynomial optimization: RAPOSa, a freely available global solver, Domain reduction techniques for global NLP and MINLP optimization, Convex envelopes of products of convex and component-wise concave functions, A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization, An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver, Variable neighborhood search: basics and variants, FiberSCIP—A Shared Memory Parallelization of SCIP, A note on solving MINLP's using formulation space search, Undercover: a primal MINLP heuristic exploring a largest sub-MIP, An improved Bernstein global optimization algorithm for MINLP problems with application in process industry, Strong-branching inequalities for convex mixed integer nonlinear programs, Reformulations in mathematical programming: automatic symmetry detection and exploitation, Stabilizer-based symmetry breaking constraints for mathematical programs, Extended formulations for convex envelopes, Lago: a (heuristic) branch and cut algorithm for nonconvex minlps, Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON, SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework, RBFOpt: an open-source library for black-box optimization with costly function evaluations, Lift-and-Project Cuts for Mixed Integer Convex Programs, Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts, Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts, A computational study of primal heuristics inside an MI(NL)P solver, Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes, PAVER 2.0: an open source environment for automated performance analysis of benchmarking data, Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Global optimization of nonconvex problems with convex-transformable intermediates, Rounding-based heuristics for nonconvex MINLPS, A dynamic convexized method for nonconvex mixed integer nonlinear programming, Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests, Global optimization of general non-convex problems with intermediate bilinear substructures, Lagrangian decomposition of block-separable mixed-integer all-quadratic programs, Tuning BARON using derivative-free optimization algorithms, An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs, Solving convex MINLP optimization problems using a sequential cutting plane algorithm, The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers, A server for automated performance analysis of benchmarking data, SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications, RENS. The optimal rounding, Granularity in nonlinear mixed-integer optimization, Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes, MINLPLib, MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library, Mixed integer nonlinear programming using interior-point methods, Alternative regularizations for outer-approximation algorithms for convex MINLP, An optimisation approach to constructing an exchange-traded fund, Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
Uses Software
