MINLPLib
From MaRDI portal
Software:18306
swMATH6172MaRDI QIDQ18306FDOQ18306
Author name not available (Why is that?)
Cited In (only showing first 100 items - show all)
- PAVER 2.0: an open source environment for automated performance analysis of benchmarking data
- SUSPECT: MINLP special structure detector for Pyomo
- 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
- QPLIB: a library of quadratic programming instances
- 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
- Convex relaxations for mixed-integer nonlinear programs
- Lift-and-project cuts for mixed integer convex programs
- A numerical study of MIDACO on 100 MINLP benchmarks
- Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps
- 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
- A proximal-point outer approximation algorithm
- 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
- Learning and Propagating Lagrangian Variable Bounds for Mixed-Integer Nonlinear Programming
- The supporting hyperplane optimization toolkit for convex MINLP
- A dynamic convexized method for nonconvex mixed integer nonlinear programming
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- A reduced space branch and bound algorithm for a class of sum of ratios problems
- 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
- Title not available (Why is that?)
- 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
- FiberSCIP—A Shared Memory Parallelization of SCIP
- SO-MI: a surrogate model algorithm for computationally expensive nonlinear mixed-integer black-box global optimization problems
- 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
- RENS. The optimal rounding
- Market neutral portfolios
- 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
- 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
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- A benchmark library of mixed-integer optimal control problems
- 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
- LaGO -- an object oriented library for solving MINLPs
- Extending a CIP framework to solve MIQCPs
- A mixed-discrete particle swarm optimization algorithm with explicit diversity-preservation
- RBFOpt: an open-source library for black-box optimization with costly function evaluations
- Analyzing the computational impact of MIQCP solver components
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
- Global optimization algorithm for mixed integer quadratically constrained quadratic program
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- 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
- Computing feasible points for binary MINLPs with MPECs
- Review and comparison of algorithms and software for mixed-integer derivative-free optimization
- On generalized surrogate duality in mixed-integer nonlinear programming
- An optimisation approach to constructing an exchange-traded fund
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function
- On decomposition and multiobjective-based column and disjunctive cut generation for MINLP
- On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming
- Global optimization of nonconvex problems with convex-transformable intermediates
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
- Using regularization and second order information in outer approximation for convex MINLP
- Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms
- Sequence of polyhedral relaxations for nonlinear univariate functions
- Variable neighborhood search: basics and variants
- Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization
- The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers
- Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts
- MathOptInterface: A Data Structure for Mathematical Optimization Problems
- On the implementation and strengthening of intersection cuts for QCQPs
- Tuning BARON using derivative-free optimization algorithms
- Supporting global numerical optimization of rational functions by generic symbolic convexity tests
- Computational advances in polynomial optimization: RAPOSa, a freely available global solver
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
- Domain reduction techniques for global NLP and MINLP optimization
- Granularity in nonlinear mixed-integer optimization
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver
- Alternative regularizations for outer-approximation algorithms for convex MINLP
- Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems
This page was built for software: MINLPLib