Course Description

Mathematics 344a/b Discrete Optimization

Network problems: shortest path, spanning trees, flow problems, matching, routing. Complexity. Integer programming.
Prerequisite: One of Mathematics 223b, 236, 343a/b, Statistical Sciences 236, the former Actuarial Science 325a/b, or permission of the Department.
3 lecture hours, half course.