2013-2014 2014-2015 2015-2016 2016-2017 2017-2018
Browse
by subject...
    Schedule
view...
 

1 - 2 of 2 results for: MS&E 112: Mathematical Programming and Combinatorial Optimization

MS&E 112: Mathematical Programming and Combinatorial Optimization (MS&E 212)

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.
Terms: Win | Units: 3 | Grading: Letter or Credit/No Credit
Instructors: Saberi, A. (PI)

MS&E 319: Approximation Algorithms

Combinatorial and mathematical programming techniques to derive approximation algorithms for NP-hard optimization problems. Prossible topics include: greedy algorithms for vertex/set cover; rounding LP relaxations of integer programs; primal-dual algorithms; semidefinite relaxations. May be repeated for credit. Prerequisites: 112 or CS 161.
Terms: Aut | Units: 3 | Repeatable for credit | Grading: Letter or Credit/No Credit
Instructors: Saberi, A. (PI)
Filter Results:
term offered
updating results...
number of units
updating results...
time offered
updating results...
days
updating results...
UG Requirements (GERs)
updating results...
component
updating results...
career
updating results...
© Stanford University | Terms of Use | Copyright Complaints