Pages that link to "Item:Q652688"
From MaRDI portal
The following pages link to Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs (Q652688):
Displaying 7 items.
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (Q340017) (← links)
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447) (← links)
- Reduced RLT representations for nonconvex polynomial programming problems (Q427362) (← links)
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612) (← links)
- Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems (Q1361075) (← links)
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems (Q1371947) (← links)
- Global optimization of general nonconvex problems with intermediate polynomial substructures (Q2250104) (← links)