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

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.

Additionally, efforts have been made to extend the feasibility pump framework to general mixed integer variables, demonstrating its versatility beyond purely binary problems [4].

Zero-one integer programming is a mathematical method of using a series of yes (1) and no (0) answers to arrive at a solution.