Pages that link to "Item:Q2331354"
From MaRDI portal
The following pages link to New SOCP relaxation and branching rule for bipartite bilinear programs (Q2331354):
Displaying 13 items.
- Convexification of bilinear forms through non-symmetric lifting (Q2045010) (← links)
- Convex hull representations for bounded products of variables (Q2046306) (← links)
- Inside-ellipsoid outside-sphere (IEOS) model for general bilinear feasibility problems: feasibility analysis and solution algorithm (Q2103717) (← links)
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem (Q2176277) (← links)
- On the facet defining inequalities of the mixed-integer bilinear covering set (Q2216198) (← links)
- On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations (Q5072594) (← links)
- Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
- The Convex Hull of a Quadratic Constraint over a Polytope (Q5131962) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5918426) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5925639) (← links)
- \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables (Q6052055) (← links)
- Shortest Paths in Graphs of Convex Sets (Q6188512) (← links)
- A disjunctive cutting plane algorithm for bilinear programming (Q6622752) (← links)
