MATH 583
ORDER AND OPTIMIZATION, Fall 2006
This is an advanced graduate course on partially ordered sets and
combinatorial optimization, generally offered once every three 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.
Resources (mostly in postscript)
- List of known TYPOS in Fall 2006
pre-publication printing of text
- Course announcement
- Books on reserve
- SUMMARY of lectures
- Fall 2006 Homework:
1,
2,
3,
4,
5,
6,
7,
8,
9.
- Archive: Summary of lectures from Fall 2004
- Archive: Typos in Fall 2004 text
- Archive of problem sets from Fall 2004:
1, 2, 3,
4, 5, 6,
7, 8, 9,
- Archive of problem sets from Fall 2002:
1, 2, 3,
4, 5, 6,
7, 8, 9,