| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651661 | Electronic Notes in Discrete Mathematics | 2015 | 6 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
