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. Meets with ENGSE732. Students may not receive credit for both.