Preview this course in the non-credit experience today! Start working toward program admission and requirements right away. Work you complete in the non-credit ...

Integer Linear Programming: Basics, Branch-and-Bound, Cutting Plane Methods. Combinatorial Optimization: Basics of approximation algorithms. Network flow problems. Interior point methods. 2 Aug 24 ...