**Assigned:**
Thursday, April 27, 2006

**Due:**
Wednesday, May 3, 2006

## 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.34. Augmenting paths
- 12.36 Augmenting paths
- 12.40 Maximal matchings
- 17.22. Two commodity flows.
- 17.26. Concurrent flows.

### Switch to:

cliff@ieor.columbia.edu