Welcome to Math 409, Spring 2009

(last updated June 4, 2009)

What is 409?

Math 409 studies discrete optimization, which concerns minimizing/maximizing a function of variables taking on discrete/integer values. Examples include the Traveling Salesman problem, minimum spanning tree problem, maximum matching problem, shortest path problem, minimum cost network flow problem, and integer program. These problems were first studied in the 18th century by Euler and have important applications in engineering, science, statistics, economics and management. We will study the theory of and algorithms for solving these problems. Since this is a fourth year math course, you will be expected to do some proofs, as well as numerical examples.
Course Info:
Prerequisites: Topics to be covered: Important Dates Notes and Comments:
Handouts (Pdf files)

Homeworks (Pdf files)

Links of Interest: Ø