MINLPLib -- a collection of test models for mixed-integer nonlinear programming
From MaRDI portal
Publication:2884552
DOI10.1287/IJOC.15.1.114.15159zbMATH Open1238.90104OpenAlexW2155258508MaRDI QIDQ2884552FDOQ2884552
Authors: Michael R. Bussieck, Arne Stolbjerg Drud, Alexander Meeraus 
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
Recommendations
Mixed integer programming (90C11) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Cited In (77)
- PAVER 2.0: an open source environment for automated performance analysis of benchmarking data
- A computational study of primal heuristics inside an MI(NL)P solver
- 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
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts
- Lift-and-project cuts for mixed integer convex programs
- Global optimization of nonconvex problems with convex-transformable intermediates
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
- 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
- A dynamic convexized method for nonconvex mixed integer nonlinear programming
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- Non polyhedral convex envelopes for 1-convex functions
- Disjunctive Cuts for Nonconvex MINLP
- Convex envelopes of products of convex and component-wise concave functions
- Variable neighborhood search: basics and variants
- 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
- The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers
- 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
- FiberSCIP—A Shared Memory Parallelization of SCIP
- MINLPLib
- 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
- GLOMIQO: global mixed-integer quadratic optimizer
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- MathOptInterface: A Data Structure for Mathematical Optimization Problems
- RENS. The optimal rounding
- An improved Bernstein global optimization algorithm for MINLP problems with application in process industry
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Tuning BARON using derivative-free optimization algorithms
- A hybrid LP/NLP paradigm for global optimization relaxations
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Strong-branching inequalities for convex mixed integer nonlinear programs
- Stabilizer-based symmetry breaking constraints for mathematical programs
- Minotaur: a mixed-integer nonlinear optimization toolkit
- Three ideas for a feasibility pump for nonconvex MINLP
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- Mixed integer nonlinear programming using interior-point methods
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- A benchmark library of mixed-integer optimal control problems
- A server for automated performance analysis of benchmarking data
- Rounding-based heuristics for nonconvex MINLPS
- Domain reduction techniques for global NLP and MINLP optimization
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver
- A mixed-discrete particle swarm optimization algorithm with explicit diversity-preservation
- Alternative regularizations for outer-approximation algorithms for convex MINLP
- RBFOpt: an open-source library for black-box optimization with costly function evaluations
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
- Using interior-point methods within an outer approximation framework for mixed integer nonlinear programming
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- A note on solving MINLP's using formulation space search
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- An optimisation approach to constructing an exchange-traded fund
- A branch-and-bound algorithm with growing datasets for large-scale parameter estimation
- Mitigating anomalies in parallel branch-and-bound based algorithms for mixed-integer nonlinear optimization
- Comparative analysis of several models of the same same mixed-integer nonlinear programing problem
- Sequence of polyhedral relaxations for nonlinear univariate functions
- A computational study of perspective cuts
- Efficient separation of RLT cuts for implicit and explicit bilinear products
- Supporting global numerical optimization of rational functions by generic symbolic convexity tests
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones
- Computational advances in polynomial optimization: RAPOSa, a freely available global solver
- Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints
- Global optimization: a machine learning approach
- Granularity in nonlinear mixed-integer optimization
- Generating feasible points for mixed-integer convex optimization problems by inner parallel cuts
Uses Software
This page was built for publication: MINLPLib -- a collection of test models for mixed-integer nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884552)
