Integer programming, a cornerstone of combinatorial optimisation, focuses on the selection of discrete decision variables to solve complex real‐world problems such as scheduling, network design and ...

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

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

A mean-variance portfolio selection model suitable for the small investor is formulated as a sequence of quadratic integer programming problems. The special structure of these quadratic problems is ...

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

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

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