Pages that link to "Item:Q1975377"
From MaRDI portal
The following pages link to Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations (Q1975377):
Displaying 7 items.
- Reduced RLT representations for nonconvex polynomial programming problems (Q427362) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions (Q1025998) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs (Q1935886) (← links)
- Linearity embedded in nonconvex programs (Q2583177) (← links)
- LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization (Q6589750) (← links)
