Abstract
We consider the Bipartite Boolean Quadratic Programming Problem (BQP01), which generalizes the well-known Boolean quadratic programming problem (QP01). The model has applications in graph theory, matrix factorization and bioinformatics, among others. The primary focus of this paper is on studying the structure of the Bipartite Boolean Quadric Polytope (BQPm,n) resulting from a linearization of a quadratic integer programming formulation of BQP01.We present some basic properties and partial relaxations of BQPm,n, as well as some families of facets and valid inequalities. We find facet-defining inequalities including a family of odd-cycle inequalities. We discuss various approaches to obtain a valid inequality and facets from those of the related Boolean quadric polytope. The key strategy is based on rounding coefficients, and it is applied to the families of clique and cut inequalities in BQPm,n.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
