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.

The following is a simple mixed integer programming problem. Details can be found in Example 3.8 in the "Examples" section. data; input _row_ $10. choco gumdr ichoco igumdr _type_ $ _rhs_; datalines; ...

In this paper we discuss some branch and bound methods implemented in the UMPIRE mathematical programming system for solving practical integer programming problems and give details of computational ...