The following pages link to Maximal Quadratic-Free Sets (Q5041754):
Displaying 8 items.
- On a generalization of the Chvátal-Gomory closure (Q2118122) (← links)
- Maximal quadratic-free sets (Q2118125) (← links)
- Generating valid linear inequalities for nonlinear programs via sums of squares (Q2198537) (← links)
- On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations (Q5072594) (← links)
- Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5918425) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5918426) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5925639) (← links)
