The following pages link to (Q2861492):
Displaying 9 items.
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- A fair division approach to humanitarian logistics inspired by conditional value-at-risk (Q1640048) (← links)
- Deriving convex hulls through lifting and projection (Q1646568) (← links)
- A survey of adjustable robust optimization (Q1740490) (← links)
- Convex hull representations for bounded products of variables (Q2046306) (← links)
- Tightening methods based on nontrivial bounds on bilinear terms (Q2168621) (← links)
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem (Q2176277) (← links)
- Error bounds for monomial convexification in polynomial optimization (Q2414910) (← links)
- Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms (Q6181371) (← links)