Assigned:
Friday, November 30, 2001
Due:
Thursday, December 6, 2001
General Instructions
- 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.
- Please do not express an algorithm using only pseudocode.
Additional explanation is required!
- Numbered problems are all from the textbook Network Flows .
Problems
- Problem 12.34, 12.36. Matching algorthm.
- Problem 12.42. Unmatchable nodes
- Problem 12.44. Matching on a tree.
- Problem 17.22. 2-commodity flows.
- Problem 17.26. Concurrent flow problem.
- Problem 17.28. More on the concurrent flow problem.
Switch to:
cliff@ieor.columbia.edu