SYEN 7342 - Network and Combinatorial Optimization

Three hours lecture. Three credit hours.

An in-depth study of combinatorial programming and network flow optimization. Emphasis on discrete optimization and specialized solution techniques that are efficient way to solve mixed-integer programming problems. Techniques include minimum cost flow, networks with gain, multi-commodity flow networks, networks with side constraints and Lagrangian relaxation. Computational complexity is also discussed.

Prerequisites: SYEN 5342 or consent of the instructor.