This is a preview. Log in through your library . Abstract This paper describes a method to arrive at a feasible solution which can not be found in the linearly approximated constrained domain and a ...

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.