Abstract
In a previous work we have presented a procedure for generating rank and non-rank valid inequalities for the stable set polytope based on clique projection and lifting operations. In this work we propose to apply another lifting operation and give some sufficient conditions for this new procedure to generate facet defining inequalities. Computational experience shows that the proposed approach allows to obtain tighter upper bounds for the maximum stable set problem.
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.
