Pages that link to "Item:Q5925639"
From MaRDI portal
The following pages link to Lifting convex inequalities for bipartite bilinear programs (Q5925639):
Displaying 8 items.
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- Lifted inequalities for 0-1 mixed integer programming: superlinear lifting (Q1424282) (← links)
- Deriving convex hulls through lifting and projection (Q1646568) (← links)
- Separating tight metric inequalities by bilevel programming (Q1939716) (← links)
- Convexification of bilinear forms through non-symmetric lifting (Q2045010) (← links)
- New SOCP relaxation and branching rule for bipartite bilinear programs (Q2331354) (← links)
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets (Q2638385) (← links)
- (Q3747717) (← links)