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.

Linear programming solutions addressing ISR asset allocation are surfacing in the academic and private sectors. A GMU graduate-level paper, presented on the day of Dantzig’s death, takes on the ...