Cut generation for an employee timetabling problem
Motivated by an industrial application, we study a specific employee timetabling problem. Several investigations are being conducted: a lower bound by Lagrangian relaxation, a heuristic based on a cut generation process and an exact method by Benders decomposition. Experimental results on real and generated instances are reported.
employee timetabling problem benders decomposition multi-choice multi-dimensional knapsack problem