Cycle inequalities play an important role in the polyhedral study of the periodic timetabling problem. We give the first pseudo-polynomial time separation algorithm for cycle inequalities, and we give a rigorous proof for the pseudo-polynomial time separability of the change-cycle inequalities. The efficiency of these cutting planes is demonstrated on real-world instances of the periodic timeta...

In this paper, we prove some compact generalizations of some well-known Bernstein type inequalities concerning the maximum modulus of a polynomial and its derivative in terms of maximum modulus of a polynomial on the unit circle. Besides, an inequality for self-inversive polynomials has also been obtained, which in particular gives some known inequalities for this class of polynomials. All the ...

The comb inequalities are a well-known class of facet-inducing inequalities for the Traveling Salesman Problem, defined in terms of certain vertex sets called the handle and the teeth. We say that a comb inequality is simple if the following holds for each tooth: either the intersection of the tooth with the handle has cardinality one, or the part of the tooth outside the handle has cardinality...