Welcome to Math 409, Spring 2009

(last updated June 4, 2009) New

No class on Friday, June 5!
For information about the final exam on Wednesday June 10, see Handout 2
HW 7 & 8 comments are posted below.

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:

Instructor: Paul Tseng (Padelford C-344; tseng@math.washington.edu)
Office Hours: Tuesdays 2:00-3:30 pm or whenever I am free
Lecture: MWF 11:30-12:20 PM, Room LOW 113
Teaching Assistant: Julie/Julia Eaton (Padelford C-404; jreaton@math.washington.edu)
Office Hours: Tuesday 10:30-12:30 (or by arrangement)
Textbook: Course Notes (version March 2009). References: Applied Combinatorics, either 1st edition by Fred Roberts, 1984 or 2nd edition by Fred Roberts and Barry Tesman, 2003. [The book is also on reserve at Math Research Library in Padelford.]

Prerequisites:

Topics to be covered:

Important Dates

April 24, May 8, May 29 Quizzes 1--3 (15-20 min).
Fri, May 15 Midterm (50 min).
Wed, June 10 (2:30-4:20) Final Exam (110 min).

Notes and Comments:

tseng@math.washington.edu

Handouts (Pdf files)

Syllabus

Homeworks (Pdf files)

Links of Interest: Ø