SC/MATH-3172 3.00:Combinatorial-Optimization

Course Description:

Introduces students to combinatorial optimization (integer programming), including problem formulation, branch-and-bound method, cutting-plane method, implicit enumeration, and its business and industrial applications, including transportation problem, network flow optimization etc. Prerequisites: SC/MATH 3171 3.00, SC/MATH 1021 3.00 or SC/MATH 1025 3.00 or SC/MATH 2221 3.00. Course credit exclusions: AP/ECON 3120 3.00, AP/ADMS 3331 3.00, AP/ADMS 3351 3.00, GL/MATH 3660 6.00, SC/MATH 3170 6.00 (prior to Winter 2016).

Language of Instruction:

English

Term W     Section M Please click here to see availability. Section Director: Mohammad Reza Peyghami Type Day Start Time Duration Location Cat # Instructor Notes/Additional Fees LECT 01 T 10:00 90 R 10:00 90 X85E01 Mohammad Reza Peyghami This course will be offered through remote/online delivery and can have synchronous sessions during the day and time noted.

Course Materials

https://data.mendeley.com/datasets/db9hbpggwx/draft?a=23589658-fe31-4d46-bf7b-1f9b6b6f63a7