Pages that link to "Item:Q1960192"
From MaRDI portal
The following pages link to Global optimization problems and domain reduction strategies (Q1960192):
Displaying 11 items.
- Extended reverse-convex programming: an approximate enumeration approach to global optimization (Q288222) (← links)
- Theoretical and computational results about optimality-based domain reductions (Q288410) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Reduced RLT representations for nonconvex polynomial programming problems (Q427362) (← links)
- Three enhancements for optimization-based bound tightening (Q522269) (← links)
- On interval-subgradient and no-good cuts (Q613320) (← links)
- Bidimensional packing by bilinear programming (Q1016113) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Time-optimal velocity planning by a bound-tightening technique (Q1753068) (← links)
- Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns (Q1787334) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
