This course addresses formulation and solution techniques for integer programming problems and network optimization problems. Topics covered include integer programming models, branch and bound method, transportation, assignment, and transshipment problems, and network flow problems such as shortest-path, maximum-flow, activity networks, minimum-cost network flow, and minimum spanning tree. Prerequisites: Graduate Standing and Consent of Instructor. (F;S)