Abstract
AbstractWe study the Chvátal rank of two linear relaxations of the stable set polytope, the edge constraint and the clique constraint stable set polytope. For some classes of graphs whose stable set polytope is given by 0/1‐valued constraints only, we present either the exact value of the Chvátal rank or upper bounds (of the order of their largest cliques and stable sets), which improve the bounds previously known from the literature (of the order of the graph itself).
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 callMore From: International Transactions in Operational Research
Disclaimer: 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.
