Network Optimization

Catalog description

Description: Network flows and combinatorial optimization models and algorithms with an emphasis on mathematical and algorithmic fundamentals. Covers basics of graph theory, algorithmic analysis, and complexity theory. Covers Classical Algorithms for shortest paths, minimum spanning trees, max-flow and min-cut, min-cost flows; P versus NP, traveling salesman problem, local search, metaheuristics, Christofides algorithm. Previously offered as IEM 6013.