Tight MIP formulations for bounded length cyclic sequences

Thomas Kalinowski, Tomas Lidén, Hamish Waterer

We study cyclic binary strings with bounds on the lengths of the intervals of consecutive ones and zeros. This is motivated by scheduling problems where such binary strings can be…