Pages that link to "Item:Q1361075"
From MaRDI portal
The following pages link to Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems (Q1361075):
Displaying 12 items.
- A dynamic inequality generation scheme for polynomial programming (Q263184) (← 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)
- Global optimality conditions and optimization methods for polynomial programming problems (Q496629) (← links)
- Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs (Q652688) (← links)
- A global optimization RLT-based approach for solving the fuzzy clustering problem (Q816063) (← links)
- On linear programming relaxations for solving polynomial programming problems (Q1654348) (← links)
- A new two-level linear relaxed bound method for geometric programming problems (Q1774846) (← links)
- Global optimization of general nonconvex problems with intermediate polynomial substructures (Q2250104) (← links)
- A reformulation-linearization based algorithm for the smallest enclosing circle problem (Q2666744) (← links)
- An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (Q3009764) (← links)
- Global optimization of general non-convex problems with intermediate bilinear substructures (Q5746708) (← links)
