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

This is a preview. Log in through your library . Abstract In an earlier paper [20] combinatorial programming procedures were presented for solving a class of integer programming problems in which all ...

Management Science, Vol. 21, No. 4, Application Series (Dec., 1974), pp. 474-482 (9 pages) This paper presents the application of a modified mixed-integer programming algorithm to plan menus in which ...

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