The following pages link to MINLPLib (Q18306):
Displaying 50 items.
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT (Q2124807) (← links)
- A disjunctive cut strengthening technique for convex MINLP (Q2129197) (← links)
- On decomposition and multiobjective-based column and disjunctive cut generation for MINLP (Q2129200) (← links)
- Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems (Q2147914) (← links)
- Sequence of polyhedral relaxations for nonlinear univariate functions (Q2147925) (← links)
- The supporting hyperplane optimization toolkit for convex MINLP (Q2162510) (← links)
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming (Q2173514) (← links)
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function (Q2181606) (← links)
- SUSPECT: MINLP special structure detector for Pyomo (Q2182769) (← links)
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems (Q2182853) (← links)
- Outer approximation with conic certificates for mixed-integer convex problems (Q2195682) (← 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)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- A branch-and-cut algorithm for mixed-integer bilinear programming (Q2282539) (← links)
- Using regularization and second order information in outer approximation for convex MINLP (Q2297649) (← 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)
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm (Q2506191) (← links)
- Computational advances in polynomial optimization: RAPOSa, a freely available global solver (Q2689854) (← links)
- Exact and fast algorithms for mixed-integer nonlinear programming (Q2802655) (← links)
- Extending a CIP Framework to Solve MIQCPs (Q2897306) (← links)
- (Q2897314) (← links)
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
- Lift-and-Project Cuts for Mixed Integer Convex Programs (Q3009750) (← links)
- A numerical study of MIDACO on 100 MINLP benchmarks (Q3165903) (← links)
- Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization (Q3296380) (← links)
- Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests (Q3589077) (← links)
- Convex relaxations for mixed-integer nonlinear programs (Q4605948) (← links)
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON (Q4637830) (← links)
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework (Q4637831) (← links)
- (Q4788630) (← links)
- Learning and Propagating Lagrangian Variable Bounds for Mixed-Integer Nonlinear Programming (Q4922925) (← links)
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes (Q4972544) (← links)
- On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming (Q5041755) (← links)
- Using projected cutting planes in the extended cutting plane method (Q5057972) (← links)
- MathOptInterface: A Data Structure for Mathematical Optimization Problems (Q5085984) (← links)
- Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms (Q5110560) (← links)
- FiberSCIP—A Shared Memory Parallelization of SCIP (Q5131706) (← links)
- Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts (Q5158763) (← links)
- Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps (Q5348468) (← links)
- (Q5411275) (← links)
- Global optimization of general non-convex problems with intermediate bilinear substructures (Q5746708) (← links)
- Global Optimization and Constraint Satisfaction (Q5897039) (← links)
