IEM 5063 - Network Flows and Combinatorial Optimization

Prerequisite(s): 5013 or equivalent. Network flows and combinatorial optimization models, and algorithms with an emphasis on applications in transportation and logistics planning. Covers basics of graph theory and complexity theory; algorithms for shortest paths, max flows and min cut, min cost flows, assignments and matchings, min spanning trees, traveling salesman problem, local search and metaheuristics including simulating annealing, genetic algorithm and tabu search.

Spring Dates: 
Tuesday, January 17, 2017 to Friday, May 5, 2017
Additional Information: 

Textbook Information:

Network Flows: Theory, Algorithms, and Applications, Prentice Hall, 1993. ISBN: 978-0136175490.

Registration Procedure: 

Dr. Baski Balasundaram