New SOCP relaxation and branching rule for bipartite bilinear programs

Santanu S. Dey, Asteroide Santana, Yang Wang

A bipartite bilinear program (BBP) is a quadratically constrained quadratic optimization problem where the variables can be partitioned into two sets such that fixing the variables…