IE252Undergraduate
Network Flows and Integer Programming
Printed in the catalogue as NETWORK FLOWS AND INTEGER PROGRAMMING
Course content
Transportation and network models. Solution algorithms. Project scheduling. Integer programming models. Weak and strong formulations. Cutting plane and branch and bound algorithms. Heuristic approaches to large-scale problems. Introduction to nonlinear programming. Karush-Kuhn-Tucker optimality conditions.
Where it sits in a curriculum
Programs whose published curriculum lists this course, and the term it falls in. Your own curriculum is the one that counts.
- Industrial EngineeringYear 2, Spring semester
More in IE
- IE102Industrial Engineering Orientation
- IE206Scientific Computing for Industrial Engineering
- IE241Financial and Managerial Accounting for Engineers
- IE251Linear Programming
- IE265Introduction to Probability
- IE266Engineering Statistics
- IE300Summer Practice I
- IE304Production and Service Information Systems