Pages that link to "Item:Q2196293"

The following pages link to Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293):

Displaying 9 items.

• Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem (Q1741115) (← links)
• On tackling reverse convex constraints for non-overlapping of unequal circles (Q2045013) (← links)
• On a generalization of the Chvátal-Gomory closure (Q2118122) (← links)
• Maximal quadratic-free sets (Q2118125) (← links)
• Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem (Q2176277) (← links)
• Generating valid linear inequalities for nonlinear programs via sums of squares (Q2198537) (← links)
• A branch-and-cut algorithm for mixed-integer bilinear programming (Q2282539) (← links)
• Intersection Disjunctions for Reverse Convex Sets (Q5076701) (← links)
• (Global) optimization: historical notes and recent developments (Q6114910) (← links)