The problem of minimizing a multilinear function of binary variables is a well-studied NP-hard problem. The set of solutions of the standard linearization of this problem is called the multilinear set, and many valid inequalities for its convex hull are available in the literature. Motivated by a machine learning application, we study a cardinality constrained version of this problem with upper and lower bounds on the number of nonzero variables. We call the set of solutions of the standard linearization of this problem a cardinality constrained multilinear set, and give a complete polyhedral description of its convex hull when the multilinear terms in the problem have a nested structure.
CITATION STYLE
Chen, R., Dash, S., & Günlük, O. (2020). Cardinality constrained multilinear sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12176 LNCS, pp. 54–65). Springer. https://doi.org/10.1007/978-3-030-53262-8_5
Mendeley helps you to discover research relevant for your work.