Capturing the set of algorithms as a linear polytope holds the following immediate advantages: • Computing the optimal algorithm reduces to solving a linear program. • Proving an upper bound on the ...

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.