A column generation approach to high school timetabling modeled as a multicommodity flow problem.

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