This paper establishes an intrinsic complexity for the integer-programming problem that goes well beyond the computational complexities of linear programming. To this end, it describes a procedure ...

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.

Mixed integer programming modeling for the satellite three-dimensional component assignment and layout optimization problem [J].