Print and PDF Options

MATH 3802 [0.5 credit] Combinatorial Optimization

Network flow problems, network simplex method, max-flow min-cut problem, integral polyhedra, minimum-weight spanning tree problem, maximum matching problem, maximum stable set problem, introduction to approximation algorithms.
Prerequisite(s): MATH 3801 or permission of the School.
Lectures three hours a week, tutorial one hour a week.