Integer programming and combinatorial optimization form the backbone of many decision-making and resource allocation problems across diverse fields, from logistics and telecommunications to finance ...

This course examines formulation and solution of applicable optimization models, including linear, integer, nonlinear, and network problems, efficient algorithm methods, and use of computer modeling ...

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

We discuss an integer linear programming modeling system based on relational algebra. In this system, all modeling related activities, such as model formulation, model instantiation, and model and ...

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