Proximity guarantees of a lift-and-project approach for the cardinality-constrained Boolean quadric polytope
Résumé
We consider a lift-and-project approach for the cardinality-constrained Boolean quadric polytope. Some upper bounds for the distance between the polytope and its linear approximation are derived. Unsurprisingly, the distance converges to 0 when the number of variables increases sufficiently.
Origine | Fichiers produits par l'(les) auteur(s) |
---|