Abstract
Given a graph G=(V,E), a family of nonempty vertex-subsets S⊆2V, and a weight w:S→R+, the maximum stable set problem with weights on vertex-subsets consists in finding a stable set I of G maximizing the sum of the weights of the sets in S that intersect I. This problem arises within a natural column generation approach for the vertex coloring problem. In this work we perform an initial polyhedral study of this problem, by introducing a natural integer programming formulation and studying the associated polytope. We address general facts on this polytope including some lifting results, we provide connections with the stable set polytope, and we present three families of facet-inducing inequalities.
Sign-in/Register to access full text options 
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.
