Graph and Combinatorial Optimization
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, and programming methodology.
MS&E 112
Units: 3
See When It's Offered opens a new window opens in a new tab
Typically Offered
Not Available
Grading Basis
Letter or Credit/No Credit
Class Level
Undergraduate
Instructional Mode
In Person
Gen Ed Requirement(s)
None