Pages that link to "Item:Q522270"
From MaRDI portal
The following pages link to Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization (Q522270):
Displaying 5 items.
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (Q2045008) (← links)
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem (Q2176277) (← links)
- Error bounds for monomial convexification in polynomial optimization (Q2414910) (← links)
- The Convex Hull of a Quadratic Constraint over a Polytope (Q5131962) (← links)
- Efficient linear reformulations for binary polynomial optimization problems (Q6164618) (← links)
