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.

We have found that the nontrivial integer programming problems we encounter tend to fall into two classes. The first class of problems is characterized by a relatively small number (less than 100) of ...

Binary Integer Programming (BIP): A mathematical optimisation technique where decision variables are restricted to binary values, commonly used to model selection and assignment problems such as ...