GloMIQO
From MaRDI portal
Cited in
(only showing first 100 items - show all)- BARON
- PaPILO
- SCIP
- LaGO
- TOPOS
- GLOPTLAB
- CONOPT
- testenv
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- Couenne
- A MIQCP formulation for B-spline constraints
- Weighted quadrature rules via Grüss type inequalities for weighted \(L^{p}\) spaces
- On decomposability of multilinear sets
- LINDO
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
- Global optimization of MIQCPs with dynamic piecewise relaxations
- An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems
- A computational study of global optimization solvers on two trust region subproblems
- A customized branch-and-bound approach for irregular shape nesting
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
- GLOBALLib
- MINLP
- QP
- CppAD
- On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation
- Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns
- MINLPLib
- LINDOGlobal
- MINOTAUR
- libMC
- modMC
- Analyzing the computational impact of MIQCP solver components
- CQP
- GLOPEQ
- ROSE
- CGLS
- COIN-OR/GAMSLinks
- APOGEE
- ANTIGONE
- Dantzig-Wolfe reformulations for binary quadratic problems
- A disjunctive cut strengthening technique for convex MINLP
- Bi-objective design-for-control of water distribution networks with global bounds
- Optimization and validation of pumping system design and operation for water supply in high-rise buildings
- Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
- SUSPECT: MINLP special structure detector for Pyomo
- Mathematical programming formulations for piecewise polynomial functions
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
- A fully general, exact algorithm for nesting irregular shapes
- Cutting ellipses from area-minimizing rectangles
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Multivariate McCormick relaxations
- Global optimization of general nonconvex problems with intermediate polynomial substructures
- A note on convex reformulation schemes for mixed integer quadratic programs
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
- QPLIB: a library of quadratic programming instances
- Global optimality bounds for the placement of control valves in water supply networks
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations
- ARGONAUT: algorithms for global optimization of constrained grey-box computational problems
- Linear transformation based solution methods for non-convex mixed integer quadratic programs
- Error bounds for monomial convexification in polynomial optimization
- A partial outer convexification approach to control transmission lines
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- Boost Interval Arithmetic
- QuadProgBB
- CMU-IBM
- JGloptLab
- Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach
- A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming
- A reformulation-linearization technique for optimization over simplices
- Improved convex and concave relaxations of composite bilinear forms
- OPTI
- SHOT
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
- Exact and fast algorithms for mixed-integer nonlinear programming
- Linear and parabolic relaxations for quadratic constraints
- RLT-POS
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- Packing ellipsoids by nonlinear optimization
- cGOP
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- A model for clustering data from heterogeneous dissimilarities
- Optimization Test Environment
- Lamatto++
- MIQCR-CB
- Piecewise Linear Function Fitting via Mixed-Integer Linear Programming
- A global optimization approach for a class of MINLP problems with applications to crude oil scheduling problem
- A new branch and bound algorithm for integer quadratic programming problems
- HASP
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- IQCP/MIQCP
- A framework for globally optimizing mixed-integer signomial programs
- Exploiting structure in non-convex quadratic optimization and gas network planning under uncertainty
- Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation
- Improving the performance of MIP and MINLP solvers by integrated heuristics
- Solving Quadratic Programming by Cutting Planes
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
This page was built for software: GloMIQO
