Pages that link to "Item:Q2884552"

The following pages link to MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming (Q2884552):

Displaying 50 items.

• MINLPLib (Q18306) (← links)
• Non polyhedral convex envelopes for 1-convex functions (Q312465) (← links)
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
• A mixed-discrete particle swarm optimization algorithm with explicit diversity-preservation (Q381954) (← links)
• A recipe for finding good solutions to MINLPs (Q384810) (← links)
• A framework for globally optimizing mixed-integer signomial programs (Q398656) (← links)
• Convex envelopes of products of convex and component-wise concave functions (Q427364) (← links)
• An improved Bernstein global optimization algorithm for MINLP problems with application in process industry (Q475423) (← links)
• Strong-branching inequalities for convex mixed integer nonlinear programs (Q480939) (← links)
• Stabilizer-based symmetry breaking constraints for mathematical programs (Q486387) (← links)
• Extended formulations for convex envelopes (Q486393) (← links)
• A dynamic convexized method for nonconvex mixed integer nonlinear programming (Q547132) (← links)
• Reformulations in mathematical programming: automatic symmetry detection and exploitation (Q662305) (← links)
• A computational study of primal heuristics inside an MI(NL)P solver (Q683729) (← links)
• SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications (Q743971) (← links)
• RENS. The optimal rounding (Q744216) (← links)
• Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
• Solving house allocation problems with risk-averse agents (Q836964) (← links)
• Lago: a (heuristic) branch and cut algorithm for nonconvex minlps (Q940828) (← links)
• Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts (Q953208) (← links)
• A hybrid LP/NLP paradigm for global optimization relaxations (Q1621693) (← links)
• Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
• Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
• An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver (Q1704912) (← links)
• Variable neighborhood search: basics and variants (Q1707084) (← links)
• RBFOpt: an open-source library for black-box optimization with costly function evaluations (Q1741116) (← links)
• Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes (Q1753434) (← links)
• Global optimization of nonconvex problems with convex-transformable intermediates (Q1756773) (← links)
• Rounding-based heuristics for nonconvex MINLPS (Q1762458) (← links)
• Lagrangian decomposition of block-separable mixed-integer all-quadratic programs (Q1771303) (← links)
• A storm of feasibility pumps for nonconvex MINLP (Q1925794) (← links)
• Convex envelopes generated from finitely many compact convex sets (Q1942266) (← links)
• A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization (Q1946925) (← links)
• The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers (Q2044966) (← links)
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library (Q2062317) (← links)
• Alternative regularizations for outer-approximation algorithms for convex MINLP (Q2089881) (← links)
• Linearization and parallelization schemes for convex mixed-integer nonlinear optimization (Q2114818) (← links)
• Sequence of polyhedral relaxations for nonlinear univariate functions (Q2147925) (← links)
• Optimality-based domain reduction for inequality-constrained NLP and MINLP problems (Q2182853) (← links)
• PAVER 2.0: an open source environment for automated performance analysis of benchmarking data (Q2250081) (← links)
• Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation (Q2250087) (← links)
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
• Tuning BARON using derivative-free optimization algorithms (Q2274849) (← links)
• An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs (Q2274851) (← links)
• Granularity in nonlinear mixed-integer optimization (Q2302751) (← links)
• An optimisation approach to constructing an exchange-traded fund (Q2341093) (← links)
• Three ideas for a feasibility pump for nonconvex MINLP (Q2361121) (← links)
• A note on solving MINLP's using formulation space search (Q2448189) (← links)
• Undercover: a primal MINLP heuristic exploring a largest sub-MIP (Q2452383) (← links)