Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling

We compare the lower bounds we obtained, with other methods from literature, on 20 data instances of real-world applications. For 16 instances the optimal solutions are known, but the remaining four are still open. Our approach improved the best-known lower bound for all four open instances, and decreased the average gap from 24 to 11%.