Pages that link to "Item:Q2392123"
From MaRDI portal
The following pages link to Bound reduction using pairs of linear inequalities (Q2392123):
Displaying 10 items.
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Three enhancements for optimization-based bound tightening (Q522269) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns (Q1787334) (← links)
- SUSPECT: MINLP special structure detector for Pyomo (Q2182769) (← links)
- Two-row and two-column mixed-integer presolve using hashing-based pairing methods (Q2219510) (← links)
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs (Q2274851) (← links)
- Global optimality bounds for the placement of control valves in water supply networks (Q2331359) (← 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)
