MS&E212
Graph and Combinatorial Optimization
Management Science and Engineering
ENGR - School of Engineering
Course Description
Optimization problems dealing with graph structure. Topics: introduction to graph theory; combinatorial optimization problems on networks including network flows, matching, and assignment problems; NP-completeness and approximation algorithms; applications in the study of social networks, market design, and bioinformatics. Prerequisites: basic concepts in linear algebra, probability theory, CS 106A or X.
Cross Listed Courses
Grading Basis
ROP - Letter or Credit/No Credit
Min
3
Max
3
Course Repeatable for Degree Credit?
No
Course Component
Lecture
Enrollment Optional?
No
Programs
MS&E212
is a
completion requirement
for: