3.00 Credits
Principal methods used in integer programming and discrete optimization; branch and bound, implicit enumeration, cutting planes, group knapsack, Lagrangian relaxation, surrogate constraints, heuristics (performance analysis), separation/branching strategies, and polynomial time algorithms for specific problems on special structures. Offered fall semester only. Students are expected to have completed a graduate-level course in linear programming before enrolling in this course.