Combinatorial Optimization and Graph Algorithms
ENG EC 732
Undergraduate Prerequisites: (ENGME411 OR CASCS330) or equivalent course on optimization or algorithms. - of algorithms for the solution of optimization problems with discrete decision spaces. Review of linear programming and duality. Discussion of advanced network optimization algorithms and matroid optimization. Approximate algorithms for NP-Hard optimization problems. Submodular optimization. Same as ENG SE 732. Students may not receive credits for both.


