IEGR 605 - Integer Programming and Network Models

3 hours.
3 Credits

Network flow models and applications. Algorithms for the shortest path, minimum cost flow and maximum flow problems. Integer programming models and formulation. Computational complexity of integer programming problems. Lagrangian duality theory, branch and bound techniques, cutting planes and hybrid algorithms. Application of these methods to facility location and traveling salesman problems. Study of special techniques for selected topics such as vehicle routing, set covering and network design problems.

Offered (AS NEEDED)