GloMIQO
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Advances for the pooling problem: modeling, global optimization, and computational studies (Survey)
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- A fully general, exact algorithm for nesting irregular shapes
- Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations
- Error bounds for monomial convexification in polynomial optimization
- PaPILO
- Mathematical programming formulations for piecewise polynomial functions
- A reformulation-linearization technique for optimization over simplices
- Learning and propagating Lagrangian variable bounds for mixed-integer nonlinear programming
- Global optimization of mixed-integer models with quadratic and signomial functions: a review
- Global optimization of general constrained grey-box models: new method and its application to constrained PDEs for pressure swing adsorption
- Relaxations and discretizations for the pooling problem
- New multi-commodity flow formulations for the pooling problem
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- Global optimization algorithm for mixed integer quadratically constrained quadratic program
- Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
- Analyzing the computational impact of MIQCP solver components
- Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems
- Global optimization of general nonconvex problems with intermediate polynomial substructures
- Multivariate McCormick relaxations
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
- Extended formulations for convex hulls of some bilinear functions
- Three enhancements for optimization-based bound tightening
- 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
This page was built for software: GloMIQO
