CourseDelta for Yorku

Suggest an Edit for SC/MATH 3172 (3.00)

SC/MATH 3172 (3.00)
Combinatorial Optimization
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).

Tips: you can drag and drop the boxes to clone them to different sections or groups within a prerequisite equation.
Prerequisite Equation
Edit the prerequisite equation to this course:
note: adding data in this section will override data in the Prerequisite List.
+ add prereq equation
Prerequisite List (Overridden by Prerequisite Equation)
Edit the list of prerequisites to this course:
note: data in this section will be override by the Prerequisite Equation if it exists.
+ add new course
Exclusion List
Edit the list of course cerdit exclusions to this course:
+ add new course
Your name (optional):

Any additional comment (optional):




Project of SSADC @ York
Made by PresidentKevvol/@Deep fried pancakes et. al.
To report a problem/mistake, email to ssadc.atyork@gmail.com
© 2021 - 2024