The k-aggregation Closure for Covering Sets
From MaRDI portal
Abstract: In this paper, we will answer one of the questions proposed by Bodur, Del~Pia, Dey, Molinaro and Pokutta in 2017. Specifically, we show that the k-aggregation closure of a covering set is a polyhedron. The proof technique is based on an equivalent condition for the closure of any particular family of cutting-planes to be polyhedral, from the perspective of convex geometry. We believe that this technique can be applied to tackle other polyhedrality problems in the future and may be of independent interest.
This page was built for publication: The k-aggregation Closure for Covering Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6330075)
