Abstract
In this paper, we study the polyhedral structure of the set of 0 – 1 integer solutions to a single knapsack constraint and multiple disjoint cardinality constraints (MCKP). This set is a generalization of the classical 0 – 1 knapsack polytope (KP) and the 0 – 1 knapsack polytope with generalized upper bounds (GUBKP). For MCKP, we extend the traditional concept of a cover to that of a generalized cover. We then introduce generalized cover inequalities and present a polynomial algorithm that can lift them into facet-defining inequalities of the convex hull of MCKP. For the case where the knapsack coefficients are non-negative, we derive strong bounds on the lifting coefficients and describe the maximal set of generalized cover inequalities. Finally, we show that the bound estimates we obtained strengthen or generalize the known results for KP and GUBKP.
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.
