GloMIQO
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- Spectral relaxations and branching strategies for global optimization of mixed-integer quadratic programs
- SUSPECT: MINLP special structure detector for Pyomo
- Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach
- A computational study of primal heuristics inside an MI(NL)P solver
- QPLIB: a library of quadratic programming instances
- ARGONAUT: algorithms for global optimization of constrained grey-box computational problems
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation
- A partial outer convexification approach to control transmission lines
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
- Dantzig-Wolfe reformulations for binary quadratic problems
- Exploiting structure in non-convex quadratic optimization and gas network planning under uncertainty
- A global optimization approach for a class of MINLP problems with applications to crude oil scheduling problem
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- The convex hull of a quadratic constraint over a polytope
- Bi-objective design-for-control of water distribution networks with global bounds
- On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation
- A new branch and bound algorithm for integer quadratic programming problems
- Linear and parabolic relaxations for quadratic constraints
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- Piecewise Linear Function Fitting via Mixed-Integer Linear Programming
- COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS
- Linear transformation based solution methods for non-convex mixed integer quadratic programs
- Optimization and validation of pumping system design and operation for water supply in high-rise buildings
- Solution approaches to linear fractional programming and its stochastic generalizations using second order cone approximations
- Global solution of non-convex quadratically constrained quadratic programs
- Tractable relaxations of composite functions
- Improved convex and concave relaxations of composite bilinear forms
- Packing ellipsoids by nonlinear optimization
- Global optimality bounds for the placement of control valves in water supply networks
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- A MIQCP formulation for B-spline constraints
- A disjunctive cut strengthening technique for convex MINLP
- Weighted quadrature rules via Grüss type inequalities for weighted \(L^{p}\) spaces
- BARON
- SCIP
- LaGO
- TOPOS
- CONOPT
- GLOPTLAB
- Couenne
- testenv
- LINDO
- GLOBALLib
- CppAD
- MINLP
- QP
- MINLPLib
- LINDOGlobal
- MINOTAUR
- libMC
- modMC
- CQP
- ROSE
- GLOPEQ
- CGLS
- COIN-OR/GAMSLinks
- APOGEE
- ANTIGONE
- Boost Interval Arithmetic
- CMU-IBM
- QuadProgBB
- JGloptLab
- OPTI
- SHOT
- RLT-POS
- cGOP
- Lamatto++
- Optimization Test Environment
- MIQCR-CB
- HASP
- IQCP/MIQCP
- StdPooling-PolyAlgos
- quadprogIP
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- A model for clustering data from heterogeneous dissimilarities
- A framework for globally optimizing mixed-integer signomial programs
- Solving Quadratic Programming by Cutting Planes
- On decomposability of multilinear sets
- The Running Intersection Relaxation of the Multilinear Polytope
- Alpine
- A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming
- Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded
- Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns
- A computational study of global optimization solvers on two trust region subproblems
- A customized branch-and-bound approach for irregular shape nesting
- An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems
- Global optimization of MIQCPs with dynamic piecewise relaxations
- Global optimization of general non-convex problems with intermediate bilinear substructures
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
- A note on convex reformulation schemes for mixed integer quadratic programs
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- Exact and fast algorithms for mixed-integer nonlinear programming
- Minotaur: a mixed-integer nonlinear optimization toolkit
- Improving the performance of MIP and MINLP solvers by integrated heuristics
- Cutting ellipses from area-minimizing rectangles
This page was built for software: GloMIQO
