Cardinality constrained Boolean quadratic polytope

✍ Scribed by Anuj Mehrotra

• Book ID: 104294805
• Publisher: Elsevier Science
• Year: 1997
• Tongue: English
• Weight: 974 KB
• Volume: 79
• Category: Article
• ISSN: 0166-218X
• DOI: 10.1016/s0166-218x(97)00039-5

✦ Synopsis

We study the polyhedral structure of an integer programming formulation of the cardinality constrained Boolean quadratic problem. We give many facet-defining inequalities. The separation problems for these inequalities appear to be difficult, which explains, in part, the difficulty encountered in solving these problems via a branch-and-cut methodology. As a special case of these inequalities, we obtain some previously known inequalities for the equipartition problem.