Advanced Topics in Discrete Optimization

Graduate

This course is concerned with topics in discrete optimization, particularly in integer programming theory and techniques. Topics include: Analysis of algorithms, modeling and applications of discrete optimization, dynamic programming, branch and cut, Lagrangian duality, modern meta-heuristic methods, introductions to nonlinear integer programming and stochastic (integer) programming, software for solving discrete program, advances in discrete optimization. (Prerequisite: INDE-3120 or equivalent.) (3 lecture hours per week.)