The following pages link to GloMIQO (Q18398):
Displaying 33 items.
- Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations (Q2357903) (← links)
- ARGONAUT: algorithms for global optimization of constrained grey-box computational problems (Q2359400) (← links)
- Linear transformation based solution methods for non-convex mixed integer quadratic programs (Q2359405) (← links)
- Error bounds for monomial convexification in polynomial optimization (Q2414910) (← links)
- A partial outer convexification approach to control transmission lines (Q2419514) (← links)
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP (Q2452383) (← links)
- Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach (Q2630216) (← links)
- A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (Q2633541) (← links)
- A reformulation-linearization technique for optimization over simplices (Q2689826) (← links)
- Improved convex and concave relaxations of composite bilinear forms (Q2697000) (← links)
- Exact and fast algorithms for mixed-integer nonlinear programming (Q2802655) (← links)
- Piecewise Linear Function Fitting via Mixed-Integer Linear Programming (Q3386779) (← links)
- A global optimization approach for a class of MINLP problems with applications to crude oil scheduling problem (Q3455302) (← links)
- A new branch and bound algorithm for integer quadratic programming problems (Q3457925) (← links)
- (Q4563725) (← links)
- Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation (Q4594828) (← links)
- Improving the Performance of MIP and MINLP Solvers by Integrated Heuristics (Q4596188) (← links)
- Solving Quadratic Programming by Cutting Planes (Q4634098) (← 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)
- Global solution of non-convex quadratically constrained quadratic programs (Q4646675) (← links)
- Learning and Propagating Lagrangian Variable Bounds for Mixed-Integer Nonlinear Programming (Q4922925) (← links)
- The Running Intersection Relaxation of the Multilinear Polytope (Q4958553) (← links)
- Tractable Relaxations of Composite Functions (Q5085133) (← links)
- Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded (Q5085481) (← links)
- The Convex Hull of a Quadratic Constraint over a Polytope (Q5131962) (← links)
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques (Q5139846) (← links)
- Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs (Q5148407) (← links)
- (Q5306655) (← links)
- (Q5411275) (← links)
- Global optimization of general non-convex problems with intermediate bilinear substructures (Q5746708) (← links)
- Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations (Q5857295) (← links)
- COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS (Q5880744) (← links)
