Discrete Optimization MATH 408 (3)
Model building using integer variables, computer solution, relaxations and lower bounds, heuristics and upper bounds, branch and bound algorithms, cutting plane algorithms, valid inequalities and facets, branch and cut algorithms, Lagrangian duality, column generation of algorithms, heuristics algorithms and analysis. Prerequisite: MATH 308 with a minimum grade of C-. Quantitative.
Mo, We, Fr 9:30 AM – 10:20 AM
SRYC 2750, Surrey