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 ...

The process requires the use of binary integer programming, a super computer, and MatLab coding language to come up with an answer. "It takes some creativity and thought," adds Stanley, who is the ...

Example 3.10: Restarting an Integer Program The following example is attributed to Haldi (Garfinkel and Nemhauser 1972) and is used in the literature as a test problem. Notice that the ACTIVEOUT= and ...