Pages that link to "Item:Q522269"

The following pages link to Three enhancements for optimization-based bound tightening (Q522269):

Displaying 26 items.

• Global optimization of MIQCPs with dynamic piecewise relaxations (Q1668791) (← links)
• Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
• Deterministic global optimization with artificial neural networks embedded (Q1730780) (← links)
• Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns (Q1787334) (← links)
• An RLT approach for solving the binary-constrained mixed linear complementarity problem (Q2002841) (← links)
• Tighter McCormick relaxations through subgradient propagation (Q2010084) (← links)
• Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems (Q2044489) (← links)
• Linearization of McCormick relaxations and hybridization with the auxiliary variable method (Q2046304) (← links)
• Advances in verification of ReLU neural networks (Q2046329) (← links)
• Deterministic global optimization with Gaussian processes embedded (Q2062323) (← links)
• Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound (Q2129196) (← links)
• SUSPECT: MINLP special structure detector for Pyomo (Q2182769) (← links)
• Deterministic global optimization of steam cycles using the IAPWS-IF97 model (Q2218882) (← links)
• An exploratory computational analysis of dual degeneracy in mixed-integer programming (Q2219511) (← links)
• A new framework to relax composite functions in nonlinear programs (Q2235154) (← links)
• Solving linear programs with complementarity constraints using branch-and-cut (Q2281449) (← links)
• Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming (Q2423782) (← links)
• A computational study on QP problems with general linear constraints (Q2673522) (← links)
• Exact solution of network flow models with strong relaxations (Q2689828) (← links)
• Computational advances in polynomial optimization: RAPOSa, a freely available global solver (Q2689854) (← links)
• Variable Bound Tightening and Valid Constraints for Multiperiod Blending (Q5106407) (← links)
• Modeling design and control problems involving neural network surrogates (Q6043129) (← links)
• Combinatorial acyclicity models for potential‐based flows (Q6065854) (← links)
• (Global) optimization: historical notes and recent developments (Q6114910) (← links)
• Presolving linear bilevel optimization problems (Q6169995) (← links)
• General convex relaxations of implicit functions and inverse functions (Q6173953) (← links)