IE 598 LM

Subject offerings of new and developing areas of knowledge in industrial engineering intended to augment the existing curriculum. See Class Schedule or departmental course information for topics and prerequisites. Course Information: Approved for letter and S/U grading. May be repeated in the same or separate terms if topics vary.

Prerequisites: Knowledge in linear programming duality is required. Description: Shortest paths on acyclic networks, labeling algorithms; Generalized shortest paths and labeling algorithms; Multi-commodity flows (and differences from the minimum-cost network flow problem), branch-and-price and cut; Lagrangean relaxation, formulations and solution techniques; Airline Schedule Planning models ￿ Set-covering and set-partitioning problem formulations; composite variable modeling (Case studies on Crew Scheduling and Airline Fleet Assignment); Combining multiple multi-commodity flow formulations; Data-driven Modeling, Simulation-optimization frameworks (Case study: Ambulance Allocation); Large-Scale neighborhood search (Case study: Vehicle routing and metaheuristics); Stochastic modeling in large-scale integer programs (Case study: Stochastic Crew Scheduling); Robust Optimization for integer programs; Operational Learning (Case study: Big Data Newsvendor problem). The course will present t