This paper develops an algorithm for pure integer programming problems. It first transforms the integer programming problem to an algebraically equivalent Hermite canonical problem, and then employs ...

This is a preview. Log in through your library . Abstract A unifying framework is developed to facilitate the understanding of most known computational approaches to integer programming. A number of ...

Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...

Research areas: Healthcare optimization under uncertainty, Large-scale optimization, stochastic programming, decomposition-based integer programming algorithms (Benders decomposition, Lagrangian ...

Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...

Methods for NP-hard discrete optimization problems, including general methods like branch-and-bound and cutting planes, as well as special purpose branch-and-cut methods. Students will be able to ...