Pages that link to "Item:Q386447"

The following pages link to Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447):

Displaying 9 items.

• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (Q340017) (← links)
• Rigorous filtering using linear relaxations (Q453629) (← links)
• Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs (Q652688) (← 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)
• On linear programming relaxations for solving polynomial programming problems (Q1654348) (← links)
• Computational advances in polynomial optimization: RAPOSa, a freely available global solver (Q2689854) (← links)
• Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints (Q6661703) (← links)