EdusalsaDiscover Your Stanford

MS&E 212

Mathematical Programming and Combinatorial Optimization (MS&E 112)

  • Not Offered

3 units

Letter or Credit/No Credit

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: 111 or MATH 103, CS 106A or X.

Course Prequisites

Sections

Section Information Unavailable

Sign Up

To save MS&E 212 to your course bucketlist

Already Have An Account? Log In