**Assigned:**
Thursday, April 16, 2009

**Due:**
Thursday, April 23, 2009

## General Instructions

- Please review the
course information.
- You must write down with whom you worked on the assignment. If this
changes from problem to problem, then you should write down this
information separately with each problem.
- Numbered problems are all from the textbook
* Network Flows *.

## Problems

- 12.12. Dance Hall Problem.
- 12.14. Doubly Stochastic Matrices.
- 12.16. Edge Colorings.
- 12.32. Unstable Roomates.
- 12.40. Maximal Matchings.

### Switch to:

cliff@ieor.columbia.edu