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.

This paper is concerned with a new linearization strategy for a class of zero-one mixed integer programming problems that contains quadratic cross-product terms between continuous and binary variables ...

Integer linear programming can help find the answer to a variety of real-world problems. Now researchers have found a much faster way to do it. The traveling salesperson problem is one of the oldest ...