Dr. Rader currently focuses his research in the areas of nonlinear 0-1 optimization, computational integer programming, and exam time timetabling.

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.

When solving the one-dimensional cutting stock problem (1D CSP) as an integer linear programming problem one has to overcome computational difficulties arising from the integrality condition and a ...

This course continues our data structures and algorithms specialization by focussing on the use of linear and integer programming formulations for solving algorithmic problems that seek optimal ...

Linear Programming: Basics, Simplex Algorithm, and Duality. Applications of Linear Programming: regression, classification and other engineering applications. Integer Linear Programming: Basics, ...

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.