Assigned:
Thursday, March 31, 2016
Due:
Thursday, April 7, 2016
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.28. Partial preference lists.
- 12.32. Unstable roommates.
- 12.34. Example of non-bipartite matching.
- 11.44, 11.46. Total unimodularity.
Switch to:
[email protected]