In linear programming we assume that all the parameters of the problem, i.e., the coefficients of the objective function, the inequalities and the availabilities are known numbers. This is frequently ...

A timetabling problem is formulated as a large integer linear programming problem in 0-1 variables. A solution method based on Lagrangean relaxation coupled with subgradient optimization is presented.