MS&E212 - Mathematical Programming and Combinatorial Optimization

Combinatorial and mathematical programming (integer and non-linear) techniques for optimization. Topics: linear program duality and LP solvers; integer programming; combinatorial optimization problems on networks including minimum spanning trees, shortest paths, and network flows; matching and assignment problems; dynamic programming; linear approximations to convex programs; NP-completeness. Hands-on exercises. Prerequisites: basic concepts in linear algebra, probability theory, CS 106A or X.
Career
Graduate
Grading Basis
ROP - Letter or Credit/No Credit
Min
3
Max
3
Course Repeatable for Degree Credit?
No

Course Component
Lecture
Enrollment Optional?
No