ESMA 451 Operations Research II
This course will introduce a variety of optimization problems with integer variables and constraints. Topics covered include assignment problems, transportation, transshipment problems, network flows problems, and IP algorithms such as Cutting Planes, Branch & Bound. Applications include the Knapsack Problem and the Traveling Salesman Problem. Appropriate Optimization software tools will be used to solve a variety of practical problems.
Prerequisite
ESMA 251