ara0001">We model the high school timetabling problem with compactness requirements.
ara0002">We propose two new models using a multicommodity flow representation.
ara0003">We propose a column generation approach for providing lower bounds for the problem.
ara0004">We found tight lower bounds that can be generated faster than previous approaches.
ara0005">New best lower bounds were found for five from twelve well-known instances.