On cycles and the stable multi-set polytope

The practical importance of the cycle inequalities is evaluated in a computational study. For this, we revisit existing polynomial time separation algorithms. The results show that the performance of state-of-the-art integer programming solvers can be improved by exploiting this general structure.