# MATH 583

## ORDER AND OPTIMIZATION, Fall 2009

This is an advanced graduate course on partially ordered sets and
combinatorial optimization, generally offered once every four semesters
(rotating with other courses). Students should be familiar with basic aspects
of combinatorics as discussed in Math 580 / CS 571. Fundamental results from
that course will be derived as needed. Main topics include Structure of Posets,
Linear Extensions, Extremal Problems for Posets, and Matroids.
The material on Linear and Integer Programming has moved to Math 588.
The text will be available soon at TIS on 6th Street.

### Resources (mostly in postscript)

- List of known
*TYPOS* in Fall 2009
pre-publication printing of text
- Course announcement
- Books on reserve
- SUMMARY of lectures in Fall 2009
- Homework for Fall 2009:
1,
2,
3,
4,
5,
6,
7,
8,
9.
- Archive: Summary of lectures -
Fall 2006, Fall 2004.
- Archive: Typos in past editions of text -
Fall 2006, Fall 2004.
- Archive of past homeworks -

Fall 2006:
1, 2, 3,
4, 5, 6,
7, 8, 9.

Fall 2004:
1, 2, 3,
4, 5, 6,
7, 8, 9,

Fall 2002:
1, 2, 3,
4, 5, 6,
7, 8, 9,